A branch-and-bound-based local search method for the flow shop problem

Journal of the Operational Research Society

Volumn 54, Issue 10, 2003, Pages 1076-1084

  Haouari, M ^a   Ladhari, T ^a,b  

^a UNIVERSITY OF CARTHAGE   (Tunisia)

^b UNIVERSITY OF TUNIS   (Tunisia)

Author keywords

Branch and bound; Flow shop sequencing; Local search

Indexed keywords

ALGORITHMS; C (PROGRAMMING LANGUAGE); COMPUTATIONAL COMPLEXITY; HEURISTIC METHODS; ITERATIVE METHODS; OPTIMIZATION; POLYNOMIALS; RESPONSE TIME (COMPUTER SYSTEMS); THEOREM PROVING;

BRANCH-AND-BOUND-BASED LOCAL SEARCH METHOD; PERMUTATION FLOW SHOP PROBLEM; SOFTWARE PACKAGE VISUAL C++;

OPERATIONS RESEARCH;

EID: 0141792665     PISSN: 01605682     EISSN: None     Source Type: Journal    
DOI: 10.1057/palgrave.jors.2601612     Document Type: Article

References (32)

1. Johnson S.M. (1954) Optimal two and three-stage production schedules with setup times. Naval Res Logist Q 1: 61-68.
2. Bellman R., Esogbue A.O and Nabeshima I. (1982) Mathematical Aspect of Scheduling and Applications. Pergamon Press: Oxford, p 202.
3. Garey M.R. Johson D.S. and Sethi R. (1976) The complexity of flowshop and job shop scheduling. Math Opns Res 1: 117-129.
4. Lenstra J.K. Rinnooy Kan A.H.G. and Brucker P. (1977) Complexity of machine scheduling problems. Ann Discrete Math 1: 343-362.
5. Levner E.V. (1969) Optimal planning of parts machining on a number of machines. Automat Remote Control 12: 1972-1979.
6. Ignall E and Schrage L.E. (1965) Application of the branch and bound technique to some flowshop problems. Opns Res 13: 400-412.
7. Land A.H. and Doig A.G. (1960) An automatic method for solving discrete programming problems. Econometrica 28: 427-520.
8. Brown A.P.G. and Lomnicki Z. A. (1966). Some applications of the branch and bound algorithm to the machine squencing problem. Opl Res Q 17: 173-186.
9. McMahon G.B. and Burton P.G. (1967) Flowshop scheduling with the branch and bound method. Opns Res 15: 473-481.
10. Ashour S. (1970). A branch and bound algorithm for the flowshop problem scheduling problem. AIIE Trans. 2: 172-176.
11. Lageweg B.J. Lenstra J. K. and Rinnooy Kan A. H. G. (1978) A general bounding scheme for the permutation flow-shop problem. Opns Res 26: 53-67.
12. Potts C.N. (1980) An adaptive branching rule for the permutation flow-shop problem. Eur J Opl Res 5: 19-25.
13. Grabowski J. (1980) On two-machine scheduling with release dates to minimize maximum lateness. Opsearch 17: 133-154.
14. Carlier J. and Rebai Ï. (1996). Two branch and bound algorithms for the permutation flow shop problem. Eur J Opl Res 90: 238-251.
15. Campbell H.G., Dudek R.A. and Smith M.L. (1970). A heuristic algorithm for the n job m machine sequencing problem. Mngt Sci 16B: 630-637.
16. Dannenbring D.G. (1977) An evaluation of flowshop sequencing heuristics. Mngt Sci 23: 1174-1182.
17. Nawaz M, Enscore E.E. and Ham I. (1983) A heuristic algorithm for the m-machine, n-job flowshop sequencing problem. Omega 11: 91-95.
18. Lai T.C. (1994) A note on the heuristics flowshop scheduling. Opns Res 44: 648-652.
19. Osman I.H. and Potts C.N. (1989). Simulated annealing for permutation flow-shop scheduling. Omega 17: 551-557.
20. max flowshop problem. Comput Opns Res 17: 243-253.
21. Ogbu F.A. and Smith D.K. (1991) Simulated annealing algorithm for the permutation flowshop problem. Omega 19: 64-67.
22. Widmer M. and Hertz (1989) A new heuristic method for the flowshop sequencing problem. Eur J Opl Res 41: 186-193.
23. Taillard E. (1993) Benchmarks for basic scheduling problems. Eur J Opl Res 64: 278-285.
24. Reeves C.R. (1993) Improving the efficiency of tabu search for machine scheduling problems. J Opl Res Soc 44: 375-382.
25. Nowicki E and Smutnicki C (1996) A fast Tabu Search algorithm for the flowshop problem. Eur J Opl Res 91: 160-175.
26. Ben-Daya M. and Al-Fawazan M. (1998) A tabu search approach for the flowshop scheduling problem. Eur J Opl Res 109: 88-95.
27. Moccellin J.V. and Nagano M.S. (1998) Evaluating the performance of tabu search procedures for flow shop sequencing. J Opl Res Soc 49: 1296-1302.
28. Chen C.L. Vempati S.V. and Aljaber N. (1995) An application of genetic algorithm for the flowshop problems. Eur J Opl Res 80: 389-396.
29. Reeves CR (1995) A genetic algorithm for flowshop sequencing. Comput Opns Res 22: 5-13.
30. Anderson E.J. Glass C.A. and Potts C.N. (1997) Machine scheduling. In: Aarts E and Lenstra JK (eds). Local Search in Combinatorial Optimization. Wiley: Chichester, pp. 361-414.
31. Ibaraki T. (1988) Branch and bounds as approximate algorithms. Ann Opns Res 10: 468-481.
32. Cirasella J. Johnson D.S. McGeoch L.A. and Zhang W. (2001) The asymmetric traveling salesman problem: algorithms, instance generators, and tests. Lect Notes Comput Sci 2153: 32-59.