A computational study of the permutation flow shop problem based on a tight lower bound

Computers and Operations Research

Volumn 32, Issue 7, 2005, Pages 1831-1847

  Ladhari, Talel ^a,b   Haouari, Mohamed ^a  

^a UNIVERSITY OF CARTHAGE   (Tunisia)

^b Ecl Sup Des Sci Economiques et C   (Tunisia)

Author keywords

Branch and bound algorithm; Permutation flow shop; Scheduling

Indexed keywords

ALGORITHMS; BOUNDARY CONDITIONS; COMPUTATIONAL COMPLEXITY; COMPUTER SIMULATION; HEURISTIC METHODS; OPTIMIZATION; PROBLEM SOLVING; SCHEDULING;

BRANCH-AND-BOUND ALGORITHMS; PERMUTATION FLOW SHOP; SHOP PROBLEM; TIGHT LOWER BOUND;

COMBINATORIAL MATHEMATICS;

EID: 9644279631     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cor.2003.12.001     Document Type: Article

References (39)

1. Pinedo M. Scheduling: theory, algorithms, and systems. Englewood Cliffs, NJ: Prentice-Hall; 1995.
2. Potts CN, Shmoys DB, Williamson DP. Permutation vs. non-permutation flow shop schedules. Operations Research Letters 1999;10:281-4.
3. Johnson SM. Optimal two- and three-stage production schedules with setup times included. Naval Research Logistics Quarterly 1954;1:61-8.
4. Anderson EJ, Glass CA, Potts CN. Machine scheduling. In: Aarts E, Lenstra JK, editors. Local search in combinatorial optimization. Chichester: Wiley; 1997. p. 361-414.
5. Garey MR, Johnson DS, Sethi R. The complexity of flow shop and job shop scheduling. Mathematics of Operations Research 1976;1:117-29.
6. Land AH, Doig AG. An automatic method for solving discrete programming problems. Econometrica 1960;28: 427-520.
7. Ignall E, Schrage LE. Application of the branch-and-bound technique to some flow shop problems. Operations Research 1965;13:400-12.
8. Lomnicki Z. A branch-and-bound algorithm for the exact solution of the three-machine scheduling problem. Operational Research Quarterly 1965;16:89-100.
9. Brown APG, Lomnicki ZA. Some applications of the branch-and-bound algorithm to the machine sequencing problem. Operational Research Quarterly 1966;17:173-86.
10. McMahon GB, Burton PG. Flowshop scheduling with the branch-and-bound method. Operations Research 1967:15:473-81.
11. Ashour S. A branch-and-bound algorithm for the flow shop problem scheduling problem. AIIE Transactions 1970;2:172-6.
12. Lageweg BJ, Lenstra JK, Rinnooy Kan AHG. A general bounding scheme for the permutation flow-shop problem. Operations Research 1978;26:53-67.
13. Potts CN. An adaptive branching rule for the permutation flow-shop problem. European Journal of Operational Research 1980;5:19-25.
14. Grabowski J. On two-machine scheduling with release dates to minimize maximum lateness. Opsearch 1980;17: 133-54.
15. Carlier J, Rebai Ï. Two branch-and-bound algorithms for the permutation flow shop problem. European Journal of Operational Research 1996;90:238-51.
16. Cheng J, Kise H, Matsumoto H. A branch-and-bound algorithm with fuzzy inference for a permutation flow shop scheduling problem. European Journal of Operational Research 1997:96:578-90.
17. Campbell HG, Dudek RA, Smith ML. A heuristic algorithm for the n-job m-machine sequencing problem. Management Science 1970;16B:630-7.
18. Dannenbring DG. An evaluation of flow shop sequencing heuristics. Management Science 1977;23:1174-82.
19. Nawaz M, Enscore Jr. EE, Ham I. A heuristic algorithm for the m-machine, n-job flow shop sequencing problem. Omega 1983;11:91-5.
20. Osman IH, Potts CN, Simulated annealing for permutation flow-shop scheduling. Omega 1989;17:551-7.
21. Nowicki E, Smutnicki C. A fast tabu search algorithm for the flow shop problem. European Journal of Operational Research 1996;91:160-75.
22. Reeves CR. A genetic algorithm for flowshop sequencing. Computers and Operations Research 1995;22:5-13.
23. Haouari M, Ladhari T. A branch-and-bound-based local search method for the flow shop problem. Journal of the Operational Research Society 2003:54:1076-84.
24. Smutnicki C. Some results of the worst-case analysis for flow shop scheduling. European Journal of Operational Research 1998:109:66-87.
25. Sviridenko MI. A note on permutation flow shop problem. Annals of Operations Research 2004, to appear.
26. Lenstra JK, Rinnooy Kan AHG, Bruker P. Complexity of machine scheduling problems. Annals of Discrete Mathematics 1977;1:343-62.
27. McMahon GB. A study of algorithms for industrial scheduling problems. PhD thesis, University of New South Wales, Kensington; 1971.
28. Jackson JR. Scheduling a production line to minimize maximum tardiness. Research Report 43, Management Science Research Project, University of California, Los Angeles; 1955.
29. Bestwick PF, Hastings NAJ. A new bound for machine scheduling. Operational Research Quarterly 1976;27: 479-87.
30. Horn WA. Some simple scheduling algorithms. Naval Research Logistics Quarterly 1974;21:177-85.
31. Carlier J. The one-machine sequencing problem. European Journal of Operational Research 1982;11:42-7.
32. Rinnooy Kan AHG. Machine scheduling problems: classification, complexity and computation, Nijhoff: The Hague; 1976.
33. Szwarc W. Mathematical aspect of the 3 × n jobshop sequencing problem. Naval Research Logistics Quarterly 1974;21:145-53.
34. Potts CN. The job-machine scheduling problem. PhD thesis, University of Birminghan; 1974.
35. Nabeshima I. On the bound of makespan and its application in m machine-schedule problem. Journal of the Operations Research Society of Japan 1967;9:98-136.
36. Haouari M, Ladhari T. Minimizing maximum lateness in a two-machine flowshop. Journal of the Operational Research Society 2000;51:1100-6.
37. Taillard E. Benchmarks for basic scheduling problems. European Journal of Operational Research 1993;64:278-85.
38. Carlier J, Pinson E. Adjustment of heads and tails for the job-shop problem. European Journal of Operational Research 1994;78:146-61.
39. Bruker P, Jurisch B, Krämer A. The job-shop problem and immediate selection, Annals of Operations Research 1994;50:73-114.