Effective Iterated Greedy Algorithm for Flow-Shop Scheduling Problems with Time lags

HODSON A, MUHLEMANN A P, PRICE D H R. A microcomputer based solution to a practical scheduling problem[J]. Journal of the Operational Research Society, 1985, 36(10): 903–914.

FONDREVELLE J, OULAMARA A, PORTMANN M C. Permutation flowshop scheduling problems with maximal and minimal time lags[J]. Computers & Operations Research, 2006, 33: 1540–1556.

SOUKHAL A, OULAMARA A, MARTINEAU P. Complexity of flow shops scheduling problems with transportation constraints[J]. European Journal of Operational Research, 2005, 161(1): 32–41.

CHU C, PROTH J. Single machine scheduling with chain structured precedence constraints and separation time windows[J]. IEEE Transactions on Robotics and Automation, Dec, 1996, 12(6): 835–843.

KIM Y D, LIM H G, PARK M-W. Search heuristics for a flowshop scheduling problem in a printed circuit board assembly process[J]. European Journal of Operational Research, 1996, 91(1): 124–143.

MANIER M A, BLOCH, C. A classification of hoist scheduling problems[J]. International Journal of Flexible Manufacturing Systems, 2003, 15(1): 37–55.

YANG D L, CHERN M S. A two-machine flowshop sequencing problem with limited waiting time constraints[J]. Computers & Industrial Engineering, 1995, 28(1): 63–70.

TANG Dunbing, DAI Min. Energy-efficient approach to minimizing the energy consumption in an extended Job-shop scheduling problem[J]. Chinese Journal of Mechanical Engineering, 2015, 28(5): 1048–1055.

NAWAZ M, ENSCORE J E E, HAM I. A heuristic algorithm for the n-job, m-machine sequencing problem[J]. Management Science 1983 16/B: 630–637.

HAMDI I, LOUKIL T. Minimizing total tardiness in the permutation flowshop scheduling problem with minimal and maximal time lags[J]. Operational Research, 2015, 15(1): 95–114.

NIKBAKHSH J P, MOHAMMAD F M, MOHAMMAD K. An immune algorithm for hybrid flow shop scheduling problem with time lags and sequence-dependent setup times[J]. The International Journal of Advanced Manufacturing Technology, 2012, 63(1–4): 337–348.

DHOUIB E, TEGHEM J, LOUKIL T. Lexicographic optimization of a permutation flow shop scheduling problem with time lag constraints[J]. International Transactions in Operational Research, 2013, 20(2): 213–232.

SHEIKH S. Multi-objective flexible flow lines with due window, time lag, and job rejection [J]. The International Journal of Advanced Manufacturing Technology, 2013, 64(9–12): 1423–1433.

WANG B L, WANG H F, LI T K. Gene exchange operators of partheno-genetic algorithm for permutation flowshop scheduling with maximum and minimum time lag constraints[C]//2015 International Conference on Material Engineering and Information Technology Applications(MEITA), Guilin, Aug 30–31, 2015: 596–600.

AMROUCHE K, BOUDHAR M. Two machines flow shop with reentrance and exact time lag[J]. RAIRO-Operations Research, 2016, 50(2): 223–232.

SANG H, GAO L, PAN Q K. Discrete artificial bee colony algorithm for lot-streaming flowshop with total flowtime minimization[J]. Chinese Journal of Mechanical Engineering, 2012, 25(5): 990-1000.

ZHAO N, CHEN S Y, DU Y H. Emergency local searching approach for Job shop scheduling[J]. Chinese Journal of Mechanical Engineering, 2013, 26(5): 918–927.

CAUMOND A, LACOMME P, TCHERNEV N. A memetic algorithm for the job-shop with time lags[J]. Computers & Operations Research, 2008, 35(7): 2331–2356.

ARTIGUES C, HUGUET M J, LOPEZ P. Generalized disjunctive constraint propagation for solving the job shop problem with time lags[J]. Engineering Applications of Artificial Intelligence, 2011, 24(2): 220–231.

GONZALEZ M A, ODDI A, RASCONI R, et al. Scatter search with path relinking for the job shop with time lags and setup times[J]. Computers & Operations Research, 2015, 60: 37–54.

AFSAR H M, LACOMME P, REN L, et al. Resolution of a Job-Shop problem with transportation constraints: a master/slave approach[J]. IFAC-PapersOnLine, 2016, 49(12): 898–903.

JOHNSON S M. Optimal two-and three-stage production schedules with setup times included[J]. Naval Research Logistics Quarterly, 1954, 1(1): 61–68.

RUIZ R, STUTZLE T. A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem[J]. European Journal of Operational Research, 2007, 177: 2033–2049.

PAN Q K, WANG L, ZHAO B H. An improved iterated greedy algorithm for the no-wait flow shop scheduling problem with makespan criterion[J]. The International Journal of Advanced Manufacturing Technology, 2008 38 (7–8): 778–786.

DING J Y, SONG S J, ZHANG R et al. Accelerated methods for total tardiness minimization in no-wait flowshops[J]. International Journal of Production Research, 2015, 53(4): 1002–1018.

YING K C. Solving non-permutation flowshop scheduling problems by an effective iterated greedy heuristic[J]. The International Journal of Advanced Manufacturing Technology, 2008, 38(3-4): 348–354.

HARRISON R, VERA D, AHMAD B. Engineering the smart factory[J]. Chinese Journal of Mechanical Engineering, 2016, 29(6): 1046–1051.

CHEN D N, ZHANG R X, YAO C Y, et al. Dynamic topology multi force particle swarm optimization algorithm and its application[J]. Chinese journal of mechanical engineering, 2016, 29(1): 124–135.

WANG Y Y, MOU S D, WU Y H. Storage assignment optimization in a multi-tier shuttle warehousing system[J]. Chinese journal of mechanical engineering, 2016, 29(2): 421–429.

BUCKER P, KNUST S, CHENG T C E, et al. Complexity results for flow-shop and open-shop scheduling problems with transportation delays[J]. Annals of Operations Research, 2004, 129(1–4): 81–106.

DELL’AMICO M. Shop problems with two machines and time lags[J]. Operations Research, 1996, 44(5): 777–787.

MITTEN L G. Sequencing n jobs on two machines with arbitrary time lags[J]. Management Science, 1959, 5(3): 293–298.

OSMAN I H, POTTS C N. Simulated annealing for permutation flow-shop scheduling[J]. Omega, 1989, 17(6): 551–557.

HAMDI I, LOUKIL T. Minimizing the makespan in the permutation flowshop problem with maximal and minimal time lags[C]//2011 International Conference on Communications, Computing and Control Applications(CCCA), Hammamet, March 3–5, 2011: 1–6.