An asynchronous genetic local search algorithm for the permutation flowshop scheduling problem with total flowtime minimization

Expert Systems with Applications

Volumn 38, Issue 7, 2011, Pages 7970-7979

  Xu, Xiao ^a   Xu, Zhenhao ^a   Gu, Xingsheng ^a  

^a EAST CHINA UNIVERSITY OF SCIENCE AND TECHNOLOGY   (China)

Author keywords

Genetic algorithm; Permutation flow shop; Scheduling; Total flowtime

Indexed keywords

COMPUTATION TIME; CONSTRUCTIVE HEURISTIC; CROSSOVER OPERATOR; GENETIC LOCAL SEARCH ALGORITHM; INITIAL POPULATION; META HEURISTICS; PERMUTATION FLOW SHOPS; PERMUTATION FLOWSHOP SCHEDULING PROBLEMS; RESTART MECHANISM; SECOND PHASE; SOLUTION QUALITY; STATE-OF-THE-ART METHODS; THREE PHASIS; TOTAL FLOWTIME; VARIABLE NEIGHBORHOOD SEARCH;

BIOLOGY; GENETIC ALGORITHMS; LEARNING ALGORITHMS; MACHINE SHOP PRACTICE;

MATHEMATICAL OPERATORS;

EID: 79952445871     PISSN: 09574174     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.eswa.2010.12.075     Document Type: Article

References (30)

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 Wiley New York
3. S.P. Bansal Minimizing the sum of completion times of n-jobs over m-machines in a flowshop - A branch and bound approach AIIE Transactions 9 1977 306 311
4. Davis, L. (1985). Applying adaptive algorithms to epistatic domains. In Proceedings of the international joint conference on artificial intelligence (pp. 162-164).
5. J.M. Framinan, and R. Leisten An efficient constructive heuristic for flowtime minimization in permutation flow shops Omega 31 4 2003 311 317 (Pubitemid 36742549)
6. J.M. Framinan, R. Leisten, and R. Ruiz-Usano Comparison of heuristics for flowtime minimization in permutation flowshops Computers and Operations Research 32 2005 1237 1254
7. M.R. Garey, D.S. Johnson, and R. Sethi The complexity of flow shop and jobshop scheduling Mathematics of Operations Research 2 1976 117 129
8. D. Goldberg, and R. Lingle Jr. Alleles, loci, and the traveling salesman problem Proceedings of first international conference on genetic algorithms and their applications 1985 Lawrence Erlbaum Associates Hillsadale, NJ 154 159
9. R.L. Graham, F.L. Lawler, J.K. Lenstra, and K.A. Rinnooy Optimization and approximation in deterministic sequencing and scheduling: A survey Annals of Discrete Mathematics 5 1979 287 326
10. E. Ignall, and L. Schrage Application of the branch and bound technique to some flowshop scheduling problem Operations Research 13 1965 400 412
11. B. Jarboui, M. Eddaly, and P. Siarry An estimation of distribution algorithm for minimizing the total flowtime in permutation flowshop scheduling problems Computers and Operations Research 36 2009 2638 2646
12. B. Jarboui, S. Ibrahim, P. Siarry, and A. Rebai A combinatorial particle swarm optimization for solving permutation flowshop problems Computers and Industrial Engineering 54 2008 526 538 (Pubitemid 351199803)
13. S.M. Johnson Optimal two-and-three stage production schedules with setup times included Naval Research Logistics Quarterly 1 1954 61 68
14. Xiaoping Li, Qian Wang, and Cheng Wu Efficient composite heuristics for total flowtime minimization in permutation flow shops Omega 37 2009 155 164
15. J. Liu, and C.R. Reeves Constructive and composite heuristics solution of the scheduling problem European Journal of Operational Research 132 2001 439 452 (Pubitemid 32385032)
16. T. Murata, H. Ishibuchi, and H. Tanaka Genetic algorithms for flowshop scheduling problems Computers and Industrial Engineering 30 1996 1061 1071 (Pubitemid 126375914)
17. Oliver, I. M., Smith, D. J., Holland, J. R. C. (1987). A study of permutation crossover operators on the traveling salesman problem. In Proceedings of the second international conference on genetic algorithms and their applications, Hillsadale, NJ (pp. 224-230).
18. C. Rajendran Heuristic algorithm for scheduling in flow shop to minimize total flow time International Journal of Production Economics 29 1993 65 73 (Pubitemid 23623618)
19. C. Rajendran, and D. Chaudhuri An efficient heuristic approach to the scheduling of jobs in a flow shop European Journal of Operation Research 61 1991 318 325
20. C. Rajendran, and H. Ziegler An efficient heuristic for scheduling in a flow shop to minimize total weighted flowtime of jobs European Journal of Operational Research 103 1997 129 138 (Pubitemid 127396735)
21. C. Rajendran, and H. Ziegler Ant-colony algorithms for permutation flowshop scheduling to minimize makespan/total flowtime of jobs European Journal of Operational Research 155 2 2004 426 438
22. C. Rajendran, and H. Ziegler Two ant-colony algorithms for minimizing total flowtime in permutation flowshops Computers and Industrial Engineering 48 2005 789 797 (Pubitemid 40391497)
23. R. Ruiz, C. Maroto, and J. Alcaraz Two new robust genetic algorithms for the flowshop scheduling problem Omega 34 2006 461 476 (Pubitemid 43046058)
24. 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 2007 2033 2049 (Pubitemid 44712036)
25. E. Taillard Benchmarks for basic scheduling problems European Journal of Operational Research 64 2 1993 278 285 (Pubitemid 23599340)
26. 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 2007 1930 1947 (Pubitemid 44780934)
27. C. Wang, C. Chu, and J.M. Proth Heuristics approaches for scheduling problems European Journal of Operational Research 96 1997 636 644
28. D.S. Woo, and H.S. Yim A heuristic algorithm for mean flow time objective in flow shop scheduling Computers and Operations Research 25 1998 175 182
29. sum permutation flowshop scheduling problem by genetic local search. In Proceedings of 1998 IEEE international conference on evolutionary computation (pp. 230-234).
30. Y. Zhang, Xiaoping Li, and Qian Wang Hybrid genetic algorithm for permutation flowshop scheduling problems with total flowtime minimization European Journal of Operational Research 196 2009 869 876