A robust simulated annealing heuristic for flow shop scheduling problems

International Journal of Advanced Manufacturing Technology

Volumn 23, Issue 9-10, 2004, Pages 762-767

  Low, Chinyao ^a   Yeh, Jinn Yi ^a   Huang, Kai I ^a  

^a DA YEH UNIVERSITY   (Taiwan)

Author keywords

Flow shop scheduling; Makespan; Simulated annealing

Indexed keywords

APPROXIMATION THEORY; COMBINATORIAL MATHEMATICS; COMPUTATIONAL COMPLEXITY; GENETIC ALGORITHMS; HEURISTIC METHODS; ROBUSTNESS (CONTROL SYSTEMS); SIMULATED ANNEALING;

ENUMERATION METHODS; FLOW SHOP SCHEDULING; MAKESPAN;

SCHEDULING;

EID: 2942679514     PISSN: 02683768     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00170-003-1687-x     Document Type: Article

References (20)

1. Johnson SM (1954) Optimal two-and three-stage production schedules with setup times included. Nav Res Log 1:61-68
2. Ignall E, Schrage LE (1965) Application of branch-and-bound techniques to some flow shop problems. Operat Res 13:400-412
3. Lomnicki Z (1965) A branch-and-bound for the exact solution of the three machine scheduling problem. Operat Res 16:89-107
4. Palmer DS (1965) Sequencing jobs through a multi-stage process in the minimum total time - a quick method of obtaining a near optimum. Operat Res 16:101-107
5. Campbell HG, Dudek RA, Smith ML (1970) A heuristic algorithm for the n-job, m-machine sequencing problem. Manag Sci 16/B:630-637
6. Nawaz M, Enscore EE, Ham I (1983) A heuristic algorithm for m-machine, n-job flowshop sequencing problem. Omega 11:91-98
7. Koulamas C (1998) A new constructive heuristic for the flow-shop scheduling problem. Eur J Oper 105:66-71
8. Ishibuchi H, Misaki S, Tanaka H (1995) Modified simulated annealing algorithms for the flow shop sequencing problem. Eur J Oper 81:388-398
9. Osman IH, Potts CN (1989) Simulated annealing for permutation flow-shop scheduling, Omega 17:551-557
10. max flow shop problem, Computer and Operat Res 17:243-253
11. Taillard E (1990) Some efficient heuristic methods for the flow shop scheduling problems. Eur J Oper 47:65-74
12. Nowicki E, Smutnicki C (1996) A fast tabu search algorithm for the permutation flow-shop problem. Eur J Oper 91:160-175
13. Ben-Daya M, Al-Fawzan M (1998) A tabu search approach for the flow shop scheduling problem. Eur J Oper 109:88-95
14. Chen C-L, Vempati SV, Aljaber N (1995) An application of genetic algorithms for flow shop problems. Eur J Oper 80:389-396
15. Reeves C (1995) A genetic algorithm for flow shop sequencing. Comput Oper Res 22:5-13
16. Murata T, Ishibuchi H, Tanaka H (1996) Genetic algorithms for the flowshop scheduling problems. Comput Ind Eng 30:1061-1071
17. Van Laarhoven PJM, Aarts EHL, Lenstra JK (1992) Job shop scheduling by simulated annealing. Operat Res 40:113-125
18. Low C, Wu T-H (2001) Mathematical modeling and heuristic approaches to operation scheduling problems in an FMS environment. Int J Prod Res 39:689-708
19. Taillard E (1993) Benchmarks for the basic scheduling problems. Eur J Oper 64:278-285
20. Demirkol E, Mehta S, Uzsoy R (1998) Benchmarks for shop scheduling problems. Eur J Oper 109:137-141