Abstract
Calculation of completion times and optimal scheduling for serial multi-product, multi-unit problems have been studied for the different types of intermediate storage options. In this study, a set of simple recurrence relations for serial multi-product multi-batch processes in ZW policy is suggested, which calculates completion times with or without non-zero transfer times and non-zero sequence dependent set-up times of the last unit (j = M) for each product (i = 1, 2, ... N). An algorithm is also proposed which calculates completion times of each unit (j = 1, 2, ..., M - 1) for a given product i, not recursively but independently in ZW policy. For the case of zero transfer times and zero sequence dependent set-up times, a mixed-integer linear programming (MILP) formulation is developed, and for the case of non-zero transfer times and non-zero sequence dependent set-up times, a mixed-integer nonlinear programming (MINLP) formulation is developed for optimal scheduling in ZW policy using newly proposed algorithm which calculates completion times of each product at each stage.
| Original language | English |
|---|---|
| Pages (from-to) | 537-543 |
| Number of pages | 7 |
| Journal | Computers and Chemical Engineering |
| Volume | 18 |
| Issue number | 6 |
| Publication status | Published - 1994 Jun 1 |
| Externally published | Yes |
Fingerprint
ASJC Scopus subject areas
- Chemical Engineering(all)
- Control and Systems Engineering
Cite this
Completion times and optimal scheduling for serial multi-product processes with transfer and set-up times in zero-wait policy. / Hak Jung, Jae; Lee, Ho Kyung; Yang, Dae Ryook; Lee, In Beum.
In: Computers and Chemical Engineering, Vol. 18, No. 6, 01.06.1994, p. 537-543.Research output: Contribution to journal › Article
}
TY - JOUR
T1 - Completion times and optimal scheduling for serial multi-product processes with transfer and set-up times in zero-wait policy
AU - Hak Jung, Jae
AU - Lee, Ho Kyung
AU - Yang, Dae Ryook
AU - Lee, In Beum
PY - 1994/6/1
Y1 - 1994/6/1
N2 - Calculation of completion times and optimal scheduling for serial multi-product, multi-unit problems have been studied for the different types of intermediate storage options. In this study, a set of simple recurrence relations for serial multi-product multi-batch processes in ZW policy is suggested, which calculates completion times with or without non-zero transfer times and non-zero sequence dependent set-up times of the last unit (j = M) for each product (i = 1, 2, ... N). An algorithm is also proposed which calculates completion times of each unit (j = 1, 2, ..., M - 1) for a given product i, not recursively but independently in ZW policy. For the case of zero transfer times and zero sequence dependent set-up times, a mixed-integer linear programming (MILP) formulation is developed, and for the case of non-zero transfer times and non-zero sequence dependent set-up times, a mixed-integer nonlinear programming (MINLP) formulation is developed for optimal scheduling in ZW policy using newly proposed algorithm which calculates completion times of each product at each stage.
AB - Calculation of completion times and optimal scheduling for serial multi-product, multi-unit problems have been studied for the different types of intermediate storage options. In this study, a set of simple recurrence relations for serial multi-product multi-batch processes in ZW policy is suggested, which calculates completion times with or without non-zero transfer times and non-zero sequence dependent set-up times of the last unit (j = M) for each product (i = 1, 2, ... N). An algorithm is also proposed which calculates completion times of each unit (j = 1, 2, ..., M - 1) for a given product i, not recursively but independently in ZW policy. For the case of zero transfer times and zero sequence dependent set-up times, a mixed-integer linear programming (MILP) formulation is developed, and for the case of non-zero transfer times and non-zero sequence dependent set-up times, a mixed-integer nonlinear programming (MINLP) formulation is developed for optimal scheduling in ZW policy using newly proposed algorithm which calculates completion times of each product at each stage.
UR - http://www.scopus.com/inward/record.url?scp=38149146232&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=38149146232&partnerID=8YFLogxK
M3 - Article
AN - SCOPUS:38149146232
VL - 18
SP - 537
EP - 543
JO - Computers and Chemical Engineering
JF - Computers and Chemical Engineering
SN - 0098-1354
IS - 6
ER -