A new set of high-performing heuristics to minimise flowtime in permutation flowshops
Tóm tắt
Từ khóa
Tài liệu tham khảo
Dudek, 1964, Development of m stage decision rule for scheduling n jobs through m machines, Oper Res, 12, 471, 10.1287/opre.12.3.471
Framinan, 2005, Comparison of heuristics for flowtime minimisation in permutation flowshops, Comput Oper Res, 32, 1237, 10.1016/j.cor.2003.11.002
Framinan, 2003, Different initial sequences for the heuristic of Nawaz, Enscore and Ham to minimize makespan, idletime or flowtime in the static permutation flowshop sequencing problem, Int J Prod Res, 41, 121, 10.1080/00207540210161650
Graham, 1979, Optimization and approximation in deterministic sequencing and scheduling, Ann Discrete Math, 5, 287, 10.1016/S0167-5060(08)70356-X
Krajewski, 1987, Kanban, MRP and shaping the manufacturing environment, Manag Sci, 33, 39, 10.1287/mnsc.33.1.39
Li, 2009, Efficient composite heuristics for total flowtime minimization in permutation flow shops, Omega, 37, 155, 10.1016/j.omega.2006.11.003
Li, 2005, An efficient constructive heuristic for permutation flow shops to minimize total flowtime, Chin J Electron, 14, 203
Liu, 2001, Constructive and composite heuristic solutions to the P∥∑ci scheduling problem, Eur J Oper Res, 132, 439, 10.1016/S0377-2217(00)00137-5
Nawaz, 1983, A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem, OMEGA, Int J Manag Sci, 11, 91, 10.1016/0305-0483(83)90088-9
Pan, 2013, A comprehensive review and evaluation of permutation flowshop heuristics to minimize flowtime, Comput Oper Res, 40, 117, 10.1016/j.cor.2012.05.018
Rajendran, 1993, Heuristic algorithm for scheduling in a flowshop to minimize total flowtime, Int J Prod Econ, 29, 65, 10.1016/0925-5273(93)90024-F
Rajendran, 1997, An efficient heuristic for scheduling in a flowshop to minimize total weighted flowtime of jobs, Eur J Oper Res, 103, 129, 10.1016/S0377-2217(96)00273-1
Storer, 1992, New search spaces for sequencing problems with application to job shop scheduling, Manag Sci, 38, 1495, 10.1287/mnsc.38.10.1495
Taillard, 1990, Some efficient heuristic methods for the flow shop sequencing problem, Eur J Oper Res, 47, 65, 10.1016/0377-2217(90)90090-X
Taillard, 1993, Benchmarks for basic scheduling problems, Eur J Oper Res, 64, 278, 10.1016/0377-2217(93)90182-M
Tasgetiren, 2007, A particle swarm optimization algorithm for makespan and total flowtime minimization in the permutation flowshop sequencing problem, Eur J Oper Res, 177, 1930, 10.1016/j.ejor.2005.12.024