Exact and heuristic algorithms for the just-in-time scheduling problem in a batch processing system

详细信息    查看全文

• 作者：N. Rafiee Parsa ^{n.rafieeparsa@aut.ac.ir} ; B. Karimi ; ^{B.Karimi@aut.ac.ir} ; S.M. Moattar Husseini ^{moattarh@aut.ac.ir}
• 关键词：Just-in-time scheduling ; Batch processing machine ; Branch and bound ; Dynamic programming ; Heuristic
• 刊名：Computers & Operations Research
• 出版年：2017
• 出版时间：April 2017
• 年：2017
• 卷：80
• 期：Complete
• 页码：173-183
• 全文大小：920 K
• 卷排序：80

文摘

A just-in-time scheduling problem on a batch processing machine is considered. A mixed integer linear programming model is developed. A DP algorithm to find the optimal schedule for a given set of batches is presented. Several heuristics, a lower bounding method, and a B&B algorithm are proposed.