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 - Ryook Yang, Dae
AU - Lee, In Beum
PY - 1994/6
Y1 - 1994/6
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
U2 - 10.1016/0098-1354(93)E0009-X
DO - 10.1016/0098-1354(93)E0009-X
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 -