Flexible Batch Process Planning

详细信息    查看全文

• 作者：Yang Gul Lee and Michael F. Malone
• 刊名：Industrial & Engineering Chemistry Research
• 出版年：2000
• 出版时间：June 2000
• 年：2000
• 卷：39
• 期：6
• 页码：2045 - 2055
• 全文大小：459K
• 年卷期：v.39,no.6(June 2000)
• ISSN：1520-5045

文摘

A simulated annealing algorithm for batch process planning is described. The fortmulation treatsa broad range of problems involving a general profit function with discrete demands and duedates. It is targeted to the planning of a batch process operated in "open shop" mode withminimum inventory and maximum on-time performance. The approach is demonstrated in casestudies of a parallel network flowshop or "multiplant" structure with a zero-wait storage policybetween stages. The effects of setup time and setup costs on the schedule and production capacityare illustrated in several case studies. A large and general case analogous to a real industrialproblem is included. The approach finds significantly better solutions than the first come firstserve, shortest processing time, or earliest due date heuristics often used for productionscheduling.