Different behaviour of a double branch-and-bound algorithm on Fm | prmu | Cmax and Fm | block | Cmax problems

Computers and Operations Research

Volumn 34, Issue 4, 2007, Pages 938-953

  Companys, Ramon ^a   Mateo, Manel ^a  

^a UNIVERSITAT POLITÈCNICA DE CATALUNYA   (Spain)

Author keywords

Blocking flow shop; Double branch and bound algorithm; Permutation flow shop; Scheduling

Indexed keywords

CODES (SYMBOLS); FUNCTIONS; HEURISTIC METHODS; OPERATIONS RESEARCH; PARALLEL PROCESSING SYSTEMS; PROBLEM SOLVING;

BLOCKING FLOW-SHOP; DOUBLE BRANCH-AND-BOUND ALGORITHM; PERMUTATION FLOW-SHOP;

ALGORITHMS;

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

References (41)

1. Lawler EL, Lenstra JK, Rinnooy Kan AHG, Shmoys DB. Sequencing and scheduling: algorithms and complexity. In: Graves CG, Rinnooy Kan AHG, Zipkin P, editors. Handbooks in operations research and management science, vol. 4: Logistics of production and inventory. Amsterdam: North-Holland; 1993. p. 445-522.
2. Johnson S.M. Optimal two- and three-stage production schedules with setup time included. Naval Research Logistics Quarterly 1 1 (1954) 61-68
3. Garey M.R., Johnson D.S., and Sethi R. The complexity of flow shop and job shop scheduling. Mathematics of Operations Research 1 (1976) 117-129
4. Lomnicki Z.A. A branch and bound algorithm for the exact solution of three-machine scheduling problems. Operational Research Quarterly 16 1 (1965) 89-100
5. Ignall E., and Schrage L.E. Application of the branch-and-bound algorithm to some flow shop problems. Operations Research 13 (1965) 400-412
6. Ashour S.A. A branch-and-bound algorithm for the flow shop scheduling problem. AIIE Transactions 2 (1970) 172-176
7. Potts C.N. An adaptive branching rule for the permutation flow-shop problem. European Journal of Operational Research 5 (1980) 19-25
8. Carlier J., and Rebai{dotless}̈ I. Two branch and bound algorithms for the permutation flow shop problem. EJOR 90 (1996) 238-251
9. Cheng J., Kise H., and Matsumoto H. A branch-and-bound algorithm with fuzzy inference for a permutation flowshop scheduling problem. EJOR 96 (1997) 578-590
10. Companys R. Note on an improved branch-and-bound algorithm to solve n/m/P/Fmax problems. TOP 7 1 (1999) 25-31
11. Giglio R.J., and Wagner H.M. Approximate solutions to the three-machine scheduling problem. Operations Research 12 2 (1964)
12. Dudek R.A., and Teuton Jr. O.F. Development of m-stage decision rule for scheduling n jobs trough m-machines. Journal of the Operations Research Society of America 12 3 (1964) 471-497
13. Palmer D.S. Sequencing jobs through a multi-stage process in the minimum total time-a quick method of obtaining a near optimum. Operational Research Quarterly 16 1 (1965) 101-107
14. Companys R. Métodos heurísticos en la resolución del problema del taller mecánico. Estudios Empresariales 5 2 (1966) 3-14
15. Campbell H.G., Dudek R.A., and Smith M.L. A heuristic algorithm for the n job m-machine sequencing problem. Management Science 16 10 (1970) 630-637
16. Gupta J.N.D. A functional heuristic algorithm for the flow-shop scheduling problem. Operational Research Quarterly 22 1 (1971)
17. Dannenbring D.G. An evaluation of flow-shop sequencing heuristics. Management Science 23 (1977) 1174-1182
18. Nawaz M., Enscore E.E., and Ham I. A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem. OMEGA 11 (1983) 91-95
19. Ladhari T., and Haouari M. A computational study of the permutation flow shop problem based on a tight lower bound. Computers & Operations Research 32 (2005) 1831-1847
20. Haouari M., and Ladhari T. Minimizing maximum lateness in a two-machine flowshop. Journal of the Operational Research Society 51 (2000) 1100-1106
21. Haouari M., and Ladhari T. A branch-and-bound-based local search method for the flow shop problem. Journal of the Operational Research Society 54 (2003) 1076-1084
22. Taillard E. Benchmarks for basic scheduling problems. European Journal of Operational Research 44 (1993) 375-382
23. Hall N.G., and Sriskandarajah C. A survey of machine scheduling problems with blocking and no wait in process. Operations Research 44 3 (1996) 510-525
24. Reddi S.S., and Ramamoorthy C.V. On the flow-shop sequencing problem with no wait in process. Operational Research Quarterly 23 3 (1972) 323-331
25. Gilmore P.C., and Gomory R.E. Sequencing a one state-variable machine: a solvable case of the traveling salesman problem. Operations Research 12 (1964) 655-665
26. Gilmore P.C., Lawler E.L., and Shmoys D.B. Well-solved special cases. In: Lawler E.L., Lenstra K.L., Rinooy Kan A.H.G., and Shmoys D.B. (Eds). The traveling salesman problem: a guided tour of combinatorial optimization (1985), Wiley, New York 87-143
27. Papadimitriou C.H., and Kanellakis P.C. Flowshop scheduling with limited temporary storage. Journal of the ACM 27 3 (1980) 533-549
28. McCormick S.T., Pinedo M.L., Shenker S., and Wolf B. Sequencing in an assembly line with blocking to minimize cycle time. Operations Research 37 (1989) 925-935
29. Leisten R. Flowshop sequencing problems with limited buffer storage. International Journal of Production Research 28 11 (1990) 2085-2100
30. Brown A.P.G., and Lomnicki Z.A. Some applications of the 'branch-and-bound' algorithm to the machine scheduling problem. Operational Research Quarterly 17 4 (1966) 173-186
31. McMahon G.B., and Burton P.G. Flow-shop scheduling with the branch-and-bound method. Operations Research 15 3 (1967) 473-481
32. Watson JP, Barbulescu L, Howe AE, Whitney LD. Algorithm performance and problem structure for flow-shop scheduling. Proceedings of the 16th National Conference on AI. 1999.
33. Nagano M.S., and Moccellin J.V. A high quality solution constructive heuristic for flow shop sequencing. Journal of the Operational Research Society 53 (2002) 1374-1379
34. Ronconi D.P. A note on constructive heuristics for the flowshop problem with blocking. International Journal of Production Economics 87 (2004) 39-48
35. Companys R. Algoritmo de Lomnicki pendular, Notas sobre el problema del taller mecánico. D.I.T. 93/12, ETSEIB-UPC, 1993. p. 51-8.
36. Lageweg B.J., Lenstra J.K., and Rinnooy Kan A.H.G. A general bounding scheme for the permutation flow-shop problem. Operations Research 26 1 (1978) 53-67
37. Nabeshima I. On the bound of makespans and its application to m-machine scheduling problem. Journal of the Operations Research Society of Japan 9 (1967) 98-136
38. Ronconi D.P., and Armentano V.A. Lower bounding schemes for flowshops with blocking in-process. Journal of the Operational Research Society 52 (2001) 1289-1297
39. Vivó R. Estudio e Implementación del Algoritmo Lomnicki Pendular. PFC (Engineer thesis), ETSEIB-UPC, 1994.
40. Alemán A. Estudio y Aplicación del Algoritmo Lomnicki Pendular al Problema Fm | block | Fmax. PFC (Engineer thesis), ETSEIB-UPC, 2004.
41. Taillard E. Problem instances, flow shop sequencing, summary of best known lower and upper bounds of Taillard's instances. 2005. http://ina.eivd.ch/Collaborateurs/etd/problemes.dir/ordonnancement.dir/flowshop.dir/best_lb_up.txt