Local search methods for the flowshop scheduling problem with flowtime minimization

European Journal of Operational Research

Volumn 222, Issue 1, 2012, Pages 31-43

  Pan, Quan Ke ^a,b   Ruiz, Rubén ^c  

^a STATE KEY LABORATORY OF SYNTHETICAL AUTOMATION FOR PROCESS INDUSTRIES   (China)

^b LIAOCHENG UNIVERSITY   (China)

^c INSTITUTO DE TECNOLOGÍA QUÍMICA   (Spain)

Author keywords

Flowshop; Flowtime; Local search; Metaheuristics; Scheduling

Indexed keywords

COMPARATIVE EVALUATIONS; COMPLEX METHODS; DESIGN OF EXPERIMENTS (DOE); EFFECTIVE ALGORITHMS; FLOW SHOP PROBLEMS; FLOW SHOP SCHEDULING PROBLEM; FLOW-SHOP SCHEDULING; FLOW-SHOPS; FLOW-TIME; ITERATED LOCAL SEARCH; LOCAL SEARCH; LOCAL SEARCH METHOD; META HEURISTICS; POTENTIAL APPLICATIONS; REPLICABILITY; STATE-OF-THE-ART PERFORMANCE; TOTAL FLOWTIME;

DESIGN OF EXPERIMENTS; SCHEDULING;

ALGORITHMS;

EID: 84861810499     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejor.2012.04.034     Document Type: Article

References (56)

1. A. Allahverdi, and T. Aldowaisan New heuristics to minimize total completion time in m-machine flowshops International Journal of Production Economics 77 1 2002 71 83 (Pubitemid 34284488)
2. K.R. Baker Introduction to Sequencing and Scheduling 1974 John Wiley & Sons New York
3. F. Ballestín, C. Schwindt, and J. Zimmermann Resource leveling in make-to-order production: modeling and heuristic solution method International Journal of Operations Research 4 1 2007 50 62
4. S.P. Bansal Minimizing the sum of completion times of n jobs over m machines in a flowshop: a branch and bound approach IIE Transactions 9 3 1977 306 311
5. sum Computers & Industrial Engineering 59 4 2010 778 785
6. X.Y. Dong, H.K. Huang, and P. Chen An iterated local search algorithm for the permutation flowshop problem with total flowtime criterion Computers & Operations Research 36 5 2009 1664 1669
7. J. Dubois-Lacoste, M. López-Ibáñez, and T. Stützle A hybrid TP + PLS algorithm for bi-objective flow-shop scheduling problems Computers & Operations Research 38 8 2011 1219 1236
8. L. Fanjul-Peyro, and R. Ruiz Iterated greedy local search methods for unrelated parallel machine scheduling European Journal of Operational Research 207 1 2010 55 69
9. J.M. Framinan, R. Leisten, and R. Ruiz-Usano Comparison of heuristics for flowtime minimisation in permutation flowshops Computers & Operations Research 32 5 2005 1237 1254
10. T. Gonzalez, and S. Sahni Flowshop and jobshop schedules: complexity and approximation Operations Research 26 1 1978 36 52 (Pubitemid 8576420)
11. J.N.D. Gupta Heuristic algorithms for multistage flowshop scheduling problem AIIE Transactions 4 1 1972 11 18
12. J.N.D. Gupta, C.L. Chen, L.Y. Yap, and H. Deshmukh Designing a tabu search algorithm to minimize total flow time in a flow shop Arabian Journal for Science and Engineering 25 1C 2000 79 94 (Pubitemid 33290868)
13. E. Ignall, and L.E. Schrage Application of the branch and bound technique to some flow shop scheduling problems Operations Research 13 3 1965 400 412
14. B. Jarboui, S. Ibrahim, P. Siarry, and A. Rebai A combinatorial particle swarm optimization for solving permutation flowshop problems Computers & Industrial Engineering 54 3 2008 526 538 (Pubitemid 351199803)
15. B. Jarboui, M. Eddaly, and P. Siarry An estimation of distribution algorithm for minimizing the total flowtime in permutation flowshop scheduling problems Computers & Operations Research 36 9 2009 2638 2646
16. S.M. Johnson Optimal two- and three-stage production schedules with setup times included Naval Research Logistics Quarterly 1 1 1954 61 68
17. D. Laha, and S.C. Sarin A heuristic to minimize total flow time in permutation flow shop OMEGA, The International Journal of Management Science 37 3 2009 734 739
18. B. Laurent, and J.-K. Hao Iterated local search for the multiple depot vehicle scheduling problem Computers & Industrial Engineering 57 1 2009 277 286
19. X. Li, Q. Wang, and C. Wu Efficient composite heuristics for total flowtime minimization in permutation flow shops OMEGA, The International Journal of Management Science 37 1 2009 155 164
20. X. Li, and C. Wu An efficient constructive heuristic for permutation flow shops to minimize total flowtime Chinese Journal of Electronics 14 2 2005 203 208 (Pubitemid 40542007)
21. Cj scheduling problem European Journal of Operational Research 132 2 2001 439 452 (Pubitemid 32385032)
22. H.R. Lourenço, O.C. Martin, and T. Stützle Iterated local search: framework and applications M. Gendreau, J.Y. Potvin, Handbook of Metaheuristics second ed. International Series in Operations Research & Management Science vol. 14 2010 Kluwer Academic Publishers Norwell, MA 363 397 (Chapter 12)
23. G. Minella, R. Ruiz, and M. Ciavotta Restarted Iterated Pareto Greedy algorithm for multi-objective flowshop scheduling problems Computers & Operations Research 38 11 2011 1521 1533
24. D. Montgomery Design and Analysis of Experiments, seventh ed. 2009 John Wiley & Sons New York
25. I.H. Osman, and C.N. Potts Simulated annealing for permutation flow-shop scheduling OMEGA, The International Journal of Management Science 17 6 1989 551 557
26. Q.-K. Pan, M.F. Tasgetiren, and Y.-C. Liang A discrete differential evolution algorithm for the permutation flowshop scheduling problem Computers & Industrial Engineering 55 4 2008 795 816
27. Q.-K. Pan, and R. Ruiz An estimation of distribution algorithm for lot-streaming flow shop problems with setup times OMEGA The International Journal of Management Science 40 2 2012 166 180
28. M. Pinedo Scheduling: Theory third ed. Algorithms and Systems 2009 Springer New York
29. C. Rajendran Heuristic algorithm for scheduling in flowshop to minimize total flowtime International Journal of Production Economics 29 1 1993 65 73 (Pubitemid 23623618)
30. C. Rajendran, and H. Ziegler An efficient heuristic for scheduling in a flowshop to minimize total weighted flowtime of jobs European Journal of Operational Research 103 1 1997 129 138 (Pubitemid 127396735)
31. C. Rajendran, and H. Ziegler Ant-colony algorithms for permutation flowhsop scheduling to minimize makespan/total flowtime of jobs European Journal of Operational Research 155 2 2004 426 438
32. C. Rajendran, and H. Ziegler Two ant-colony algorithms for minimizing total flowtime in permutation flowshops Computers & Industrial Engineering 48 4 2005 789 797 (Pubitemid 40391497)
33. I. Ribas, R. Companys, and X. Tort-Martorell An iterated greedy algorithm for the flowshop scheduling problem with blocking OMEGA, The International Journal of Management Science 39 3 2011 293 301
34. R. Ruiz, C. Maroto, and J. Alcaraz Two new robutst genetic algorithms for the flowshop scheduling problem OMEGA, The International Journal of Management Science 34 5 2006 461 476 (Pubitemid 43046058)
35. R. Ruiz, and T. Stützle A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem European Journal of Operational Research 177 3 2007 2033 2049 (Pubitemid 44712036)
36. R. Ruiz, and T. Stützle An iterated greedy heuristic for the sequence dependent setup times flowshop problem with makespan and weighted tardiness objectives European Journal of Operational Research 187 3 2008 1143 1159 (Pubitemid 350245722)
37. Jr. E.F. Stafford On the development of a mixed integer linear programming model for the flowshop sequencing problem Journal of the Operational Research Society 39 12 1988 1163 1174
38. Stützle, T., 1998. Local Search Algorithms for Combinatorial Problems - Analysis, Algorithms, and New Applications. PhD thesis. TU Darmstadt, Computer Science Department. Darmstadt, Germany.
39. Stützle, T., 1998b. Applying Iterated Local Search to the Permutation Flowshop Problem. Technical Report AIDA-98-04. FG Intellektik, TU Darmstadt. Darmstadt, Germany.
40. T. Stützle Iterated local search for the quadratic assignment problem European Journal of Operational Research 174 3 2006 1519 1539 (Pubitemid 44202643)
41. E. Taillard Some efficient heuristic methods for the flow shop sequencing problem European Journal of Operational Research 47 1 1990 65 74 (Pubitemid 20733430)
42. E. Taillard Benchmarks for basic scheduling problems European Journal of Operational Research 64 2 1993 278 285 (Pubitemid 23599340)
43. L. Tang, and J. Liu A modified genetic algorithm for the flow shop sequencing problem to minimize mean flow time Journal of Intelligent Manufacturing 13 1 2002 61 67 (Pubitemid 34159963)
44. M.F. Tasgetiren, Y.-C. Liang, M. Sevkli, and G. Gencyilmaz A particle swarm optimization algorithm for makespan and total flowtime minimization in the permutation flowshop sequencing problem European Journal of Operational Research 177 3 2007 1930 1947 (Pubitemid 44780934)
45. M.F. Tasgetiren, Q.-K. Pan, P.N. Suganthan, and A.H.-L. Chen A discrete artificial bee colony algorithm for the total flowtime minimization in permutation flow Shops Information Sciences 181 16 2011 3459 3475
46. L.-Y. Tseng, and Y.-T. Lin A hybrid genetic local search for the permutation flowshop scheduling problem European Journal of Operational Research 198 1 2009 84 92
47. L.-Y. Tseng, and Y.-T. Lin A genetic local search algorithm for minimizing total flowtime in the permutation flowshop scheduling problem International Journal of Production Economics 127 1 2010 121 128
48. T. Urlings, R. Ruiz, and T. Stützle Shifting representation search for hybrid flexible flowline problems European Journal of Operational Research 207 2 2010 1086 1095
49. E. Vallada, and R. Ruiz Genetic algorithm with path relinking for the minimum tardiness permutation flowshop problem OMEGA, The International Journal of Management Science 38 1-2 2010 556 575
50. V.S. Vempati, C.-L. Chen, and S.F. Bullington An effective heuristic for flow shop problems with total flow time as criterion Computers & Industrial Engineering 25 1-4 1993 219 222
51. X. Xu, Z. Xu, and X. Gu An asynchronous genetic local search algorithm for the permutation flowshop scheduling problem with total flowtime minimization Expert systems with Applications 38 7 2011 7970 7979
52. sum permutation flowshop scheduling problem by genetic local search. In: Proceedings of the 1998 IEEE International Conference on Evolutionary Computation, pp. 230-234.
53. J. Yao, N. Kharma, and P. Grogono Bi-objective Multipopulation genetic algorithm for multimodal function optimization IEEE Transactions on Evolutionary Computation 14 1 2010 80 102
54. Y. Zhang, X. Li, and Q. Wang Hybrid genetic algorithm for permutation flowshop scheduling problems with total flowtime minimization European Journal of Operational Research 196 3 2009 869 876
55. Y. Zhang, and X. Li Estimation of distribution algorithm for permutation flow shops with total flowtime minimization Computers & Industrial Engineering 60 4 2011 706 718
56. T. Zheng, and M. Yamashiro Solving flow shop scheduling problems by quantum differential evolutionary algorithm International Journal of Advanced Manufacturing Technology 49 5-8 2010 643 662