제어로봇시스템학회:학술대회논문집
- 제어로봇시스템학회 1993년도 한국자동제어학술회의논문집(국제학술편); Seoul National University, Seoul; 20-22 Oct. 1993
- /
- Pages.30-35
- /
- 1993
Optimal scheduling for multi-product batch processes under consideration of non-zero transfer times and set-up times
- Jung, Jae-Hak (Automation Research Center, Pohang University of Science and Technology, Pohang P.O.Box 125) ;
- Lee, In-Beum (Automation Research Center, Pohang University of Science and Technology, Pohang P.O.Box 125) ;
- Yang, Dae-Ryook (Automation Research Center, Pohang University of Science and Technology, Pohang P.O.Box 125) ;
- Chang, Kun-Soo (Automation Research Center, Pohang University of Science and Technology, Pohang P.O.Box 125)
- 발행 : 1993.10.01
초록
Simple recurrence relations for calculating completion times of various storage polices (unlimited, intermediate storages(FIS), 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 been developed as a mixed integer linear programniing(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 computation times.
키워드