平行移动方式下考虑作业时间可分离的多目标流水车间批量调度
|
摘要
对平行移动方式下考虑作业时间可分离的多目标流水车间批量调度问题进行研究。构建以生产周期、总停机次数和总搬运次数为目标的基于分层序列法的多目标决策模型。建立考虑作业时间可分离的时间模型,并设计遗传算法求解流水车间批量调度问题。本研究可为功能型布局流水车间中的批量零件选出最优调度方案,并能为批量零件的加工制造、搬运以及加工制造设备的调整制定精确的生产作业计划。
A multi-objective flow shop batch scheduling problem under parallel-transfer mode in which setup,processing and handling times could be separated is researched deeply.A novel multi-objective decision-making model based on the lexicographic rank method that regards the makespan,the total number of equipment shutdown,the total handling times of batch parts as the objectives is established.The time models of batch parts with operation times separated are proposed.A new genetic algorithm is designed to deal with flow shop batch scheduling problem.This research could make the precise planning for the processes of processing and handling and the equipment adjustment as well as obtain the optimal scheduling schemes for functional layout flow shop batch scheduling problem.
A multi-objective flow shop batch scheduling problem under parallel-transfer mode in which setup,processing and handling times could be separated is researched deeply.A novel multi-objective decision-making model based on the lexicographic rank method that regards the makespan,the total number of equipment shutdown,the total handling times of batch parts as the objectives is established.The time models of batch parts with operation times separated are proposed.A new genetic algorithm is designed to deal with flow shop batch scheduling problem.This research could make the precise planning for the processes of processing and handling and the equipment adjustment as well as obtain the optimal scheduling schemes for functional layout flow shop batch scheduling problem.
引文
[1]Framinan J M,Gupta J N D,Leisten R.A review and classification of heuristics for permutation flow-shop scheduling with makespan objective[J].Journal of the Operational Research Society,2004,55(12):1243~1255.
[2]Ruiz R,Maroto C,Alcaraz J.Two new robust genetic algorithms for the flowshop scheduling problem[J].Omega,2006,34(5):461~476.
[3]Kalczynski P J,Kamburowski J.On the NEH heuristic for minimizing the makespan in permutation flow shops[J].Omega,2007,35(1):53~60.
[4]Rajkumar R,Shahabudeen P.Bi-criteria improved genetic algorithm for scheduling in flowshops to minimise makespan and total flowtime of jobs[J].International Journal of Computer Integrated Manufacturing,2009,22(10):987~998.
[5]Frosolini M,Braglia M,Zammori F A.A modified harmony search algorithm for the multi-objective flowshop scheduling problem with due dates[J].International Journal of Production Research,2011,49(20):5957~5985.
[6]Vallada E,Ruiz R.Genetic algorithms with path relinking for the minimum tardiness permutation flowshop problem[J].Omega,2010,38(1):57~67.
[7]张毕西,关迎莹,宋静.考虑学习率的人工作业系统批量加工模式优化[J].系统工程理论与实践,2010,30(4):622~627.
[8]Lin S W,et al.Minimizing makespan and total flow time in permutation flow shops by a bi-objective multi-start simulated-annealing algorithm[J].Computers&Operations Research,2013,40(6):1625~1647.
[9]Hendizadeh S H,etal.Meta-heuristics for scheduling a flowline manufacturing cell with sequence dependent family setup times[J].International Journal of Production Economics,2008,111(2):593~605.
[10]Ebrahimi M,Fatemi Ghomi S M T,Karimi B.Hybrid flow shop scheduling with sequence dependent family setup time and uncertain due dates[J].Applied Mathematical Modelling,2014,38(9):2490~2504.
[11]孔继利,贾国柱.一类多品种小批量混流制造系统作业组织模式与工件排序[J].计算机集成制造系统,2015,21(4):981~991.
[2]Ruiz R,Maroto C,Alcaraz J.Two new robust genetic algorithms for the flowshop scheduling problem[J].Omega,2006,34(5):461~476.
[3]Kalczynski P J,Kamburowski J.On the NEH heuristic for minimizing the makespan in permutation flow shops[J].Omega,2007,35(1):53~60.
[4]Rajkumar R,Shahabudeen P.Bi-criteria improved genetic algorithm for scheduling in flowshops to minimise makespan and total flowtime of jobs[J].International Journal of Computer Integrated Manufacturing,2009,22(10):987~998.
[5]Frosolini M,Braglia M,Zammori F A.A modified harmony search algorithm for the multi-objective flowshop scheduling problem with due dates[J].International Journal of Production Research,2011,49(20):5957~5985.
[6]Vallada E,Ruiz R.Genetic algorithms with path relinking for the minimum tardiness permutation flowshop problem[J].Omega,2010,38(1):57~67.
[7]张毕西,关迎莹,宋静.考虑学习率的人工作业系统批量加工模式优化[J].系统工程理论与实践,2010,30(4):622~627.
[8]Lin S W,et al.Minimizing makespan and total flow time in permutation flow shops by a bi-objective multi-start simulated-annealing algorithm[J].Computers&Operations Research,2013,40(6):1625~1647.
[9]Hendizadeh S H,etal.Meta-heuristics for scheduling a flowline manufacturing cell with sequence dependent family setup times[J].International Journal of Production Economics,2008,111(2):593~605.
[10]Ebrahimi M,Fatemi Ghomi S M T,Karimi B.Hybrid flow shop scheduling with sequence dependent family setup time and uncertain due dates[J].Applied Mathematical Modelling,2014,38(9):2490~2504.
[11]孔继利,贾国柱.一类多品种小批量混流制造系统作业组织模式与工件排序[J].计算机集成制造系统,2015,21(4):981~991.