An iterated greedy algorithm for the flowshop scheduling problem with blocking

Omega

Volumn 39, Issue 3, 2011, Pages 293-301

  Ribas, Imma ^a   Companys, Ramon ^a   Tort Martorell, Xavier ^a  

^a UNIVERSITAT POLITÈCNICA DE CATALUNYA   (Spain)

Author keywords

Blocking; Flowshop; Iterated local search; Makespan

Indexed keywords

LOCAL SEARCH (OPTIMIZATION);

ALGORITHM FOR SOLVING; BLOCKING FLOWSHOP; BLOCKINGS; FLOW SHOP SCHEDULING PROBLEM; FLOW-SHOPS; FLOWSHOP SCHEDULING PROBLEMS; ITERATED GREEDY ALGORITHM; ITERATED LOCAL SEARCH; MAKESPAN; MAKESPAN MINIMIZATION;

BENCHMARKING;

EID: 77957106725     PISSN: 03050483     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.omega.2010.07.007     Document Type: Article

References (31)

1. Hall NG, Sriskandarajah C A survey of machine scheduling problems with blocking and no wait in process. Operations Research 1996, 44(3):510-525.
2. Grabowski J, Pempera J Sequencing of jobs in some production system. European Journal of Operational Research 2000, 125(3):535-550.
3. Gong H, Tang L, Duin CW A two-stage flow shop scheduling problem on a batching machine and a discrete machine with blocking and shared setup times. Computers and Operations Research 2010, 37(5):960-969.
4. Martinez S, Dauzère-Pérès S, Guéret C, Mati Y, Sauer N Complexity of flowshop scheduling problems with a new blocking constraint. European Journal of Operational Research 2006, 169(3):855-864.
5. Oulamara A, Kovalyov MY, Finke G Scheduling a no-wait flow shop containing unbounded batching machines. IIE Transactions 2005, 37(8):685-696.
6. Graham RL, Lawler EL, Lenstra JK, Rinnooy Kan AHG Optimization and approximation in deterministic sequencing and scheduling: a survey. Annals of Discrete Mathematics 1979, 5:287-326.
7. Reddi SS, Ramamoorthy CV On the flow-shop sequencing problem with no wait in process. Operations Research Quarterly 1972, 23(3):323-331.
8. Gilmore PC, Lawler EL, Shmoys DB. Well-solved special cases. In: Lawler EL, Lenstra KL, Rinooy Kan AHG, Shmoys DB, editors. The traveling salesman problem: A Guided Tour of Combinatorial Optimization: Wiley; The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization, p. 87-143.
9. Papadimitriou CH, Kanellakis PC Flowshop scheduling with limited temporary storage. Journal of the ACM 1980, 27(3):533-549.
10. McCormick ST, Pinedo ML, Shenker S, Wolf B Sequencing in an assembly line with blocking to minimize cycle time. Operations Research 1989, 37:925-936.
11. Leisten R Flowshop sequencing problems with limited buffer storage. International Journal of Production Research 1990, 28(11):2085-2100.
12. Nawaz M, Enscore EE, Ham I A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem. Omega 1983, 11(1):91-95.
13. Kalczynski PJ, Kamburowski J An improved NEH heuristic to minimize makespan in permutation flow shops. Computers and Operations Research 2008, 35(9):3001-3008.
14. Dong X, Huang H, Chen P An improved NEH-based heuristic for the permutation flowshop problem. Computers and Operations Research 2008, 35(12):3962-3968.
15. Ribas I, Companys R, Tort-Martorell X Comparing three-step heuristics for the permutation flow shop problem. Computers and Operations Research 2010, 37(12):2062-2070.
16. Ronconi DP A note on constructive heuristics for the flowshop problem with blocking. International Journal of Production Economics 2004, 87(1):39-48.
17. Caraffa V, Ianes S, Bagchi TP, Sriskandarajah C Minimizing makespan in a blocking flowshop using genetic algorithms. International Journal of Production Economics 2001, 70(2):101-115.
18. Grabowski J, Pempera J The permutation flow shop problem with blocking. A tabu search approach. Omega 2007, 35(3):302-311.
19. Ronconi DP A branch-and-bound algorithm to minimize the makespan in a flowshop with blocking. Annals of Operations Research 2005, 138(1):53-65.
20. Wang L, Zhang L, Zheng D An effective hybrid genetic algorithm for flow shop scheduling with limited buffers. Computers and Operations Research 2006, 33(10):2960-2971.
21. Liu B, Wang L, Jin Y An effective hybrid PSO-based algorithm for flow shop scheduling with limited buffers. Computers and Operations Research 2008, 35(9):2791-2806.
22. Qian B, Wang L, Huang DX, Wang X An effective hybrid DE-based algorithm for flow shop scheduling with limited buffers. International Journal of Production Research 2009, 47(1):1-24.
23. Qian B, Wang L, Huang D, Wang W, Wang X An effective hybrid DE-based algorithm for multi-objective flow shop scheduling with limited buffers. Computers and Operations Research 2009, 36(1):209-233.
24. Wang L, Pan Q, Suganthan PN, Wang W, Wang Y A novel hybrid discrete differential evolution algorithm for blocking flow shop scheduling problems. Computers and Operations Research 2010, 37(3):509-520.
25. Ruiz R, Stützle T A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem. European Journal of Operational Research 2007, 177(3):2033-2049.
26. Companys R Métodos heurísticos en la resolución del problema del taller mecánico. Estudios Empresariales 1966, 5(2):7-18.
27. Box GEP, Cox DR An analysis of transformations (with discussions). Journal of the Royal Statistical Society 1964, Series B(26):211-256.
28. Box GEP, Andersen SL Permutation theory in derivation of robust criteria and the study of departures from assumptions. Journal of the Royal Statistical Society 1955, Series B(17):1-26.
29. Taillard E Benchmarks for basic scheduling problems. European Journal of Operational Research 1993, 64(2):278-285.
30. Companys R, Ribas I. New insights on the blocking flow shop problem. 2010, p. 1-28,. http://upcommons.upc.edu/e-prints/bitstream/2117/6985/1/DITblock-2.pdf.
31. Companys R, Mateo M Different behaviour of a double branch-and-bound algorithm on Fm|prmu|Cmax and Fm|blockvCmax problems. Computers and Operations Research 2007, 34(4):938-953.