A hybrid genetic algorithm for no-wait flowshop scheduling problem

International Journal of Production Economics

Volumn 128, Issue 1, 2010, Pages 144-152

  Tseng, Lin Yu ^a   Lin, Ya Tai ^a  

^a NATIONAL CHUNG HSING UNIVERSITY   (Taiwan)

Author keywords

Genetic algorithm; Hybrid genetic algorithm; Local search; No wait flowshop scheduling

Indexed keywords

CROSSOVER OPERATOR; FLOW SHOP SCHEDULING PROBLEM; HYBRID GENETIC ALGORITHMS; LARGE NEIGHBORHOOD; LOCAL SEARCH; LOCAL SEARCH METHOD; MAKESPAN OBJECTIVE; NO-WAIT; SEARCH PROCESS;

GENETIC ALGORITHMS; MATHEMATICAL OPERATORS;

SCHEDULING ALGORITHMS;

EID: 77957784429     PISSN: 09255273     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ijpe.2010.06.006     Document Type: Conference Paper

References (28)

1. T. Aldowaisan, and A. Allahverdi New heuristics for no-wait flowshops to minimize makespan Computers and Operations Research 30 2003 1219 1231
2. M.C. Bonney, and S.W. Gundry Solutions to the constrained flowshop sequencing problem Operational Research Quarterly 24 1976 869 883
3. J. Carlier Ordonnancements a contraintes disjonctives RAIRO Recherche Operationnelle 12 1978 333 351
4. Gonazelez, B., Torres, M., Moreno, J.A., 1995. A hybrid genetic algorithm approach for the "no-wait" flowshop scheduling problem. In: Proceedings of the First International Conference on Genetic Algorithms in Engineering Systems: Innovations and Applications, London, UK, pp. 5964.
5. J. Gupta A functional heuristic algorithm for the flowshop scheduling problem Operational Research Quarterly 22 1971 39 47
6. J. Grabowski, and J. Pempera Some local search algorithms for no-wait flow-shop problem with makespan criterion Computers and Operations Research 32 2005 2197 2212
7. J.F. Gonalves, J.J.D.M. Mendes, and M.G.C. Resende A hybrid genetic algorithm for the job shop scheduling problem European Journal of Operational Research 167 1 2005 77 95
8. R. Gangadharan, and C. Rajendran Heuristic algorithms for scheduling in the no-wait flowshop International Journal of Production Economics 32 1993 285 290
9. M. Haouari, and L. Hidri On the hybrid flowshop scheduling problem International Journal of Production Economics 113 2008 495 497
10. Ho, S.Y., Chen, J.H., 2000. A GA-based systematic reasoning approach for solving traveling salesman problems using an orthogonal array crossover. In: Proceedings of the Fourth International IEEE Conference/Exhibition on High Performance Computing in Asia-Pacific Region, Beijing, China, pp. 659663.
11. J.R. King, and A.S. Spachis Heuristics for flowshop scheduling International Journal of Production Research 18 1980 343 357
12. B.M.T. Lin, C.Y. Lu, S.J. Shyu, and C.Y. Tsai Development of new features of ant colony optimization for flowshop scheduling International Journal of Production Economics 112 2008 742 755
13. B. Liu, L. Wang, and Y.-H. Jin An effective hybrid particle swarm optimization for no-wait flow shop scheduling International Journal of Advanced Manufacturing Technology 31 2007 1001 1011
14. S.Q. Liu, and E. Kozan Scheduling a flow shop with combined buffer conditions International Journal of Production Economics 117 2009 371 380
15. C.F. Liaw A hybrid genetic algorithm for the open shop scheduling problem European Journal of Operational Research 124 1 2000 28 42
16. D.C. Montgomery Design and Analysis of Experiments 3rd ed. 1991 Wiley New York
17. D. Palmer Sequencing jobs through a multi-stage process in the minimum total timea quick method of obtaining a near optimum Operations Research Quarterly 16 1965 101 107
18. C.R. Reeves Genetic algorithms and neighborhood search Evolutionary Computing 1994 Springer Berlin pp. 115130
19. C.R. Reeves A genetic algorithm for flowshop sequencing Computers and Operations Research 22 1 1995 5 13
20. Y.B. Park A hybrid genetic algorithm for the vehicle scheduling problem with due times and time deadlines International Journal of Production Economics 73 2 2001 175 188
21. H. Rock The three-machine no-wait flowshop problem is NP-complete Journal of the Association for Computing Machinery 31 1984 336 345
22. S.S. Reddi, and C.V. Ramamoorthy On the flowshop sequencing problems with no wait intermediate queues Operational Research Quarterly 23 1972 323 331
23. C. Rajendran A no-wait flowshop scheduling heuristic to minimize makespan Journal of the Operational Research Society 45 1994 472 478
24. C.J. Schuster, and J.M. Framinan Appreciative procedures for no-wait job shop scheduling Operations Research Letters 31 2003 308 318
25. E. Taillard Some efficient heuristic methods for the flow shop sequencing problem European Journal of Operations Research 47 1990 65 74
26. J.T. Tsai, T.K. Liu, and J.H. Chou Hybrid Taguchi-genetic algorithm for global numerical optimization IEEE Transactions on Evolutionary Computation 8 4 2004 365 377
27. V. Valls, F. Ballestin, and S. Quintanilla A hybrid genetic algorithm for the resource-constrained project scheduling problem European Journal of Operational Research 185 2008 495 508
28. D.A. Wismer Solution of the flowshop sequencing problem with no intermediate queues Operations Research 20 1972 689 697