A Research on Lot Streaming in Parallel Machines Scheduling with Mold Constraint

doi:10.3969/j.issn.1007-7375.2018.03.007

Abstract

Abstract: Most scheduling problems assume that the job is produced in a single or batch mode, while in the real manufacturing environment, the job can be split. In order to solve the problem of splitting the job and making a reasonable scheduling scheme when considering the mold constraint, an optimized objective model of lot streaming in parallel machine scheduling with mold constraint is built for minimizing the makespan. Meanwhile, a mixed differential evolution genetic algorithm (DEGA), based on combination of genetic algorithm and differential evolution, is proposed to solve this model. It can implement parallel optimization of job splitting and scheduling problems. Numerical experiments and a realistic case are performed by DEGA, and the results indicate that the model and mixed algorithm are efficient and feasible.

Key words: parallel machines, lot streaming, mode constraint, DEGA(differential evolution-genetic algorithm)

CLC Number:

TP399

ZHANG Zhen, YOU Fengxiang, ZHAO Xinqiao. A Research on Lot Streaming in Parallel Machines Scheduling with Mold Constraint[J]. Industrial Engineering Journal , 2018, 21(3): 59-64.

References

[1] REITER S. A system for managing job-shop production[J]. Journal of Business, 1966, 39(3):371.
[2] CHENG M, MUKHERJEE N J, SARIN S C. A review of lot streaming[J]. International Journal of Production Research, 2013, 51(23-24):7023-7046.
[3] CHIU H N. A comprehensive review of lot streaming[J]. International Journal of Production Research, 2005, 43(8):1515-1536.
[4] 王海燕. 基于混合差分进化算法的制造过程分批优化调度研究[D]. 浙江工业大学, 2011. Wang Haiyan. New hybrid differential evolution algorithms for production scheduling problem with lot streaming[D]. Zhejiang University of Technology, 2011.
[5] 邢文训, 张家伟. 可拆分平行机排序问题研究[J]. 运筹学学报, 1998, 2(3):30-41. XING Wenxun, ZHANG Jiawei. Splitting parallel machine scheduling[J]. Opetations Research Transactions, 1998, 2(3):30-41.
[6] SHIM S O, KIM Y D. A branch and bound algorithm for an identical parallel machine scheduling problem with a job splitting property[J]. Computers & Operations Research, 2008, 35(3):863-875.
[7] LIU J. Single-job lot streaming in m - 1 two-stage hybrid flowshops[J]. European Journal of Operational Research, 2008, 187(3):1171-1183.
[8] TAHAR D N, YALAOUI F, CHU C, et al. A linear programming approach for identical parallel machine scheduling with job splitting and sequence-dependent setup times[J]. International Journal of Production Economics, 2005, 99(1):63-73.
[9] WANG W L, WANG H Y, ZHAO Y W, et al. Parallel machine scheduling with splitting jobs by a hybrid differential evolution algorithm[J]. Computers & Operations Research, 2013, 40(5):1196-1206.
[10] WANG C, LIU C, ZHANG Z H, et al. Minimizing the total completion time for parallel machine scheduling with job splitting and learning[J]. Computers & Industrial Engineering, 2016, 97(C):170-182.
[11] 史青涛. 基于遗传算法的单工序并行机分批调度研究[D]. 大连理工大学, 2014. SHI Qingtao. Research on lot splitting scheduling for parallel machines with single operation based on genetic algorithm[D]. Dalian University of Technology, 2014.
[12] 赵海丹. 有模具限制的并行机台调度问题研究[D]. 吉林大学, 2016. ZHAO Haidan. Study on parallel machines with mold constraint scheduling problem[D]. Jilin University, 2016.
[13] 亓宝梁. 多模具约束的并行多机E/T调度问题的研究[D]. 北京化工大学, 2003. QI Baoliang. Identical parallel machine E/T scheduling problem with mould. Beijing University of Chemical Technology, 2003.
[14] 玄光男. 遗传算法与工程优化[M]. 清华大学出版社, 2004.
[15] 张春美. 差分进化算法理论与应用[M]. 北京理工大学出版社, 2014.
[16] 傅珏生. 并行多机调度问题的一种遗传算法[J]. 数理统计与管理, 1998(6):13-19. FU Juesheng. A Genetic Algorithm Method for Identical Parallel Machine Scheduling Problem[J]. Journal of Applied Statistics and Management, 1998(6):13-19.
[17] LIU Min, WU Cheng. A genetic algorithm for minimizing the makespan in the case of scheduling identical parallel machines[J]. Artificial Intelligence in Engineering, 1999, 13(4):399-403.