An efficient stochastic hybrid heuristic for flowshop scheduling

Engineering Applications of Artificial Intelligence

Volumn 20, Issue 6, 2007, Pages 851-856

  Laha, Dipak ^a   Chakraborty, Uday K ^b  

^a JADAVPUR UNIVERSITY   (India)

^b UNIVERSITY OF MISSOURI ST LOUIS   (United States)

Author keywords

Heuristics; Makespan; Permutation flowshop scheduling; Simulated annealing

Indexed keywords

PROBABILITY; PROBLEM SOLVING; SIMULATED ANNEALING; STATISTICAL METHODS; STOCHASTIC MODELS;

FLOWSHOP SCHEDULING; MAKESPAN; PERMUTATION FLOWSHOP SCHEDULING;

HEURISTIC METHODS;

EID: 34250708985     PISSN: 09521976     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.engappai.2006.10.003     Document Type: Article

References (14)

1. Aarts E.H.L., and Korst J.H.M. Simulated Annealing and Boltzman Machines (1989), Wiley, Chichester
2. Campbell H.G., Dudek R.A., and Smith M.L. A heuristic algorithm for the n Job m Machine sequencing problem. Management Science 16B (1970) 630-637
3. Chakraborty U.K., Laha D., and Chakraborty M. A heuristic genetic algorithm for flowshop scheduling. Proceedings of International Conference on Information Technology and Interfaces, the 23rd ITI-2001 (2001) 313-318
4. Chakraborty, U.K., Laha, D., Efficient hybrid heuristics for flowshop scheduling-Part I: deterministic methods. In: Proceedings of the International Conference on Simulated Evolution and Learning, SEAL-2002, Singapore, 2002.
5. Hajek B. A tutorial survey of theory and applications of simulated annealing. Proceedings of IEEE Conference on Decision and Control (1985) 755-760
6. Ishibuchi H., Misaki S., and Tanaka H. Modified simulated annealing algorithms for the flowshop sequencing problem. European Journal of Operational Research 81 (1995) 388-398
7. Kirkpatrick S., Gelett C.D., and Vecchi M.P. Optimization by simulated annealing. Science 220 (1983) 621-680
8. Koulamas C. A new constructive heuristic for the flowshop scheduling problem. European Journal of Operational Research 105 (1998) 66-71
9. Kreyszig E. Advanced Engineering Mathematics (1972), Wiley, New York
10. Nawaz M., Enscore E.E., and Ham I. A heuristic algorithm for the m- Machine n- Job flowshop sequencing problem. Omega 11 (1983) 91-95
11. Ogbu F.A., and Smith D.K. The application of the simulated annealing algorithm to the solution of the n/m/Cmax flowshop problem. Computers and Operations Research 17 (1990) 243-253
12. Osman I.H., and Potts C.N. Simulated annealing for permutation flowshop scheduling. Omega 17 (1989) 551-557
13. Taillard E. Some efficient heuristic methods for the flow shop sequencing problem. European Journal of Operational Research 47 (1990) 64-74
14. Van Laarhoven P.J.M., and Aarts E.H.L. Simulated Annealing: Theory and Applications (1987), Reidel, Dordrecht, The Netherlands