A Novel Heuristic Dynamic Scheduling Algorithm for Batch-processing Machines with Non-identical Product Sizes
This paper studies the problem of scheduling batchprocessing machines which can process multiple compatible product families. Product size of different product families are not identical. At decision moments, both local information and forecast information within a look-ahead horizon can be used in scheduling. In this paper, a novel heuristic dynamic scheduling algorithm considering compatibility of products is proposed to address the problem. With the objective of minimizing average flow time, the proposed algorithm considers both total size of products left in the future machine cycles and their compatibility. The performance of the proposed algorithm is evaluated by simulation.
look-ahead batch-processing machine dynamic scheduling compatibility
Binghai Zhou Ci Chen
School of Mechanical Engineering, Tongji University, Shanghai, China School of Mechanical Engineering, Shanghai Jiao Tong University, Shanghai, China
国际会议
The Institute Industrial Engineera Asian Conference 2011(2011年国际工业工程师协会亚洲会议)
上海
英文
377-381
2011-06-10（万方平台首次上网日期，不代表论文的发表时间）