TY - GEN

T1 - Optimal scheduling for serial multi-product batch process with various storage policies under consideration of non-zero transfer times and set-up times

AU - Jae, Hak Jung

AU - Lee, In Beum

AU - Dae, Ryook Yang

AU - Kun, Soo Chang

PY - 1994

Y1 - 1994

N2 - Simple recurrence relations for calculating completion times of various storage polices (unlimited intermediate storages(UIS), finite intermediate storages(FIS), no intermediate storage(NIS), zero wait(ZW)) for serial multi-product multi-unit processes are suggested. Not only processing times but also transfer times, set-up (clean-up) times of units and set-up times of storages are considered. Optimal scheduling strategies with zero transfer times and zero set-up times had already been developed as a mixed integer linear programming (MILP) formulation for several intermediate storage policies. In this paper those with non-zero transfer times, non-zero set-up times of units and set-up times of storages are newly proposed as a mixed integer nonlinear programming (MINLP) formulation for various storage polices (UIS, NIS, FIS, and ZW). Several examples are tested to evaluate the robustness of this strategy and reasonable computational times.

AB - Simple recurrence relations for calculating completion times of various storage polices (unlimited intermediate storages(UIS), finite intermediate storages(FIS), no intermediate storage(NIS), zero wait(ZW)) for serial multi-product multi-unit processes are suggested. Not only processing times but also transfer times, set-up (clean-up) times of units and set-up times of storages are considered. Optimal scheduling strategies with zero transfer times and zero set-up times had already been developed as a mixed integer linear programming (MILP) formulation for several intermediate storage policies. In this paper those with non-zero transfer times, non-zero set-up times of units and set-up times of storages are newly proposed as a mixed integer nonlinear programming (MINLP) formulation for various storage polices (UIS, NIS, FIS, and ZW). Several examples are tested to evaluate the robustness of this strategy and reasonable computational times.

UR - http://www.scopus.com/inward/record.url?scp=0028022396&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0028022396&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:0028022396

SN - 0852953216

T3 - Institution of Chemical Engineers Symposium Series

SP - 79

EP - 86

BT - Institution of Chemical Engineers Symposium Series

PB - Publ by Inst of Chemical Engineers

T2 - Proceedings of the 4th European Symposium on Computer Aided Process Engineering

Y2 - 28 March 1994 through 30 March 1994

ER -