A comparative study of algorithms for the flowshop scheduling problem

Asia-Pacific Journal of Operational Research

Volumn 19, Issue 2, 2002, Pages 205-222

  Liu, Shiqiang ^a   Ong, H L ^a  

^a NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

Author keywords

General flowshop; Machine scheduling; Makespan; Meta heuristic; Neighborhood structure; Permutation flowshop

Indexed keywords

CRITICAL PATH ANALYSIS; HEURISTIC PROGRAMMING; PERFORMANCE; PROBLEM SOLVING; RESOURCE ALLOCATION; SCHEDULING;

PERMUTATION FLOWSHOPS;

ALGORITHMS;

EID: 0036874125     PISSN: 02175959     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (27)

1. Bellman, R. E. (1958), On a routing problem, Quarterly Applied Mathematics 16, 87-90.
2. Campbell, H. G., R. A. Dudek and M. L. Smith (1970), A heuristic algorithm for the n job, m machine sequencing problem, Management Science 16 (10), 630-637.
3. Conway, R. W., W. L. Maxwell and L. W. Miller (1967), Theory of scheduling, Addison Wesley, Reading, MA, USA.
4. Dannenbring B. G. (1977), An evaluation of flowshop sequencing heuristics, Management Science 23 (11), 1174-1181.
5. Dell'Amico, M. and M. Trubian (1993), Applying tabu search to the jobshop scheduling problem, Annals of Operations Research 41, 231-252.
6. Garey, M. R., D. S. Johnson and R. Sethi (1976), The complexity of flowshop and jobshop scheduling, Mathematics of Operations Research 1, 117-129.
7. Glover F. (1986), Future paths for integer programming and links to artificial intelligence, Computers & Operations Research 13, 533-549.
8. Glover, F. (1989), Tabu Search - Part I, ORSA Journal on Computing 1 (3), 190-206.
9. Glover, F. (1990), Tabu Search - Part II, ORSA Journal on Computing 2 (1), 4-32.
10. Gupta, J. (1971), A functional heuristic algorithm for the flowshop scheduling problem, Operational Research Quarterly 22 (1), 61-68.
11. Johnson, S. M. (1954), Optimal two- and three-stage production schedules with setup times included, Naval Research Logistics Quarterly 1 (1), 61-68.
12. Liaw, C. F. (1999), Applying simulated annealing to the open shop scheduling problem, IIE Transaction 31, 457-465.
13. Lourenco, H. R. (1995), Job-shop scheduling: computational study of local search and large-step optimization methods, European Journal of Operational Research 83, 347-364.
14. Kirkpatrick, S., C. D. Gellatt and M. P. Vecchi (1983), Optimization by simulated annealing, Science 220, 671-680.
15. Nawaz, M., E. E. Enscore and I. Ham (1983), A heuristic algorithm for the m-machine, n-job flow sequencing problem, OMEGA 11 (1), 91-95.
16. Nowicki, E. and C. Smutnicki (1996), A fast taboo search algorithm for the permutation flowshop problem, European Journal of Operational Research 91, 160-175.
17. Ogbu, F. A. and D. K. Smith (1990), simulated annealing for the permutation flowshop problem, OMEGA 19 (1), 64-67.
18. Osman, I. H. and C. N. Potts (1989), Simulated annealing for permutation flowshop scheduling, OMEGA 17 (6), 551-557.
19. Palmer, D. S. (1965), Sequencing jobs through a multi-stage process in the minimum total time - A quick method of obtain a near optimum, Operational Research Quarterly 16 (1), 101-107.
20. Pan, C. H. (1997), A study of integer programming formulations for scheduling problems, International Journal of Systems Science 28 (1), 33-41.
21. Potts, C. N. (1980), An adaptive branching rule for the permutation flowshop sequencing, European Journal of Operational Research 5 (1), 19-25.
22. Reeves, C. R. (1995), A genetic algorithm for flowshop sequencing, Computers & Operations Research 22 (1), 5-13.
23. Roy, B. and B. Sussmann (1964), Les problems d'ordonnancement avec contraintes, Technique Report 9, SEMA, Note D. S., Paris.
24. Taillard, E. (1990), Some efficient heuristic methods for the flowshop sequencing problem, European Journal of Operational Research 47, 65-74.
25. Taillard, E. (1993), Benchmarks for basic scheduling problems, European Journal of Operational Research 64, 278-285.
26. Taillard, E. (1994), Parallel taboo search techniques for the job shop scheduling problem, ORSA Journal on Computing 6 (2), 108-125.
27. Widmer, M. and A. Hertz (1989), A new heuristic method for the flowshop sequencing problem, European of Operational Research 41, 186-193.