Genetic Algorithm for Hybrid Flow-shop Scheduling with Parrel Batch Processors
In classical flow-shop scheduling problem, each processor can process one job at a time. However, in practice, there may be many processors that can process jobs batch by batch. We call these processors batch processors. If the processing time of a batch is equal to the largest processing time among its members, we call such a batch processor parallel batch processor. In this paper, we study the hybrid flow-shop problem in which the processors are parrel batch processors. This problem is obviously NP-hard. Therefore, we propose a genetic algorithm in this work.
Haodi Feng Shenpeng Lu Xiuqian Li
School of Computer Science and Technology Shandong University Jinan, P.R.China
国际会议
2009 WASE International Conference on Information Engineering(2009年国际信息工程会议)(ICIE 2009)
太原
英文
668-672
2009-07-10（万方平台首次上网日期，不代表论文的发表时间）