Completion time algorithms for serial multiproduct batch processes with shared storage

Computers and Chemical Engineering - Tập 14 - Trang 49-69 - 1990
H.-M. Ku1, I. Karimi1
1Department of Chemical Engineering, Northwestern University, Evanston, IL 60208, U.S.A.

Tài liệu tham khảo

Dutta, 1975, Sequencing two machines flowshops with finite intermediate storage, Mgmt Sci., 21, 989, 10.1287/mnsc.21.9.989 Joglekar, 1984, A simulator for batch and semi-continuous processes, Comput. chem. Engng, 8, 315, 10.1016/0098-1354(84)90001-2 Ku, 1988, Scheduling in serial multiproduct batch processes with finite interstage storage: a mixed integer linear program formulation, Ind. Engng Chem. Res., 27, 1840, 10.1021/ie00082a017 Ku, 1987, Scheduling in batch processes, Chem. Engng Prog., 83, 35 Papadimitriou, Flowshop scheduling and with limited temporary storage, J. Assoc. Comput. Mach., 27, 1980 Reklaitis, 1982, Review of scheduling process operation, AIChE Symp. Ser., 78, 119 Reklaitis G. V., Personal Communications (1989). Rajagopalan, 1989, Completion times in serial mixed-storage multiproduct processes with transfer and set-up times, Comput. chem. Engng, 13, 175, 10.1016/0098-1354(89)89016-7 Wellons M. C., Personal Communications (1988). Wiede, 1987, Determination of completion times for serial multiproduct processes—2. Multiunit finite intermediate storage system, Comput. chem. Engng, 11, 345, 10.1016/0098-1354(87)85016-0 Wiede, 1987, Determination of completion times for serial multiproduct processes—3. Mixed finite intermediate systems, Comput. chem. Engng, 11, 357, 10.1016/0098-1354(87)85017-2