Heuristics and lower bounds for minimizing the total completion time in a two-machine flowshop

International Journal of Production Economics

Volumn 122, Issue 2, 2009, Pages 678-691

  Ladhari, Talel ^a,b,c   Rakrouki, Mohamed Ali ^a,b  

^a UNIVERSITY OF CARTHAGE   (Tunisia)

^b UNIVERSITY OF TUNIS   (Tunisia)

^c NONE

Author keywords

Constructive heuristics; Flowshop; Flowtime; Genetic algorithm; Release dates

Indexed keywords

COMPUTATIONAL EXPERIMENT; CONSTRUCTIVE HEURISTIC; CONSTRUCTIVE HEURISTICS; FLOWSHOP; FLOWTIME; GENETIC LOCAL SEARCH ALGORITHM; LOWER BOUNDS; PERMUTATION FLOW SHOPS; PRIORITY RULES; RELEASE DATE; RELEASE DATES; SUM OF COMPLETION TIME; TOTAL COMPLETION TIME; TWO-MACHINE FLOWSHOP;

COMPUTATION THEORY; CONTROL THEORY; GENETIC ALGORITHMS; HEURISTIC METHODS; LEARNING ALGORITHMS;

HEURISTIC ALGORITHMS;

EID: 70350575771     PISSN: 09255273     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ijpe.2009.06.031     Document Type: Article

References (42)

1. Ahmadi R.H., and Bagchi U. Lower bounds for single-machine scheduling problems. Naval Research Logistics 37 (1990) 967-979
2. Akkan C., and Karabati S. The two-machine flowshop total completion time problem: improved lower bounds and a branch-and-bound algorithm. European Journal of Operational Research 159 (2004) 420-429
3. Allahverdi A., and Aldowaisan T. New heuristics to minimize total completion time in m-machine flowshops. International Journal of Production Economics 7 (2002) 71-83
4. Baker K.R. Introduction to Sequencing and Scheduling (1974), Wiley, New York
5. Bansal S.P. Minimizing the sum of completion times of n jobs over m machines in a flowshop-a branch and bound approach. American Institute of Industrial Engineers Transaction 9 (1977) 306-317
6. Chand S., Traub R., and Uzsoy R. Single-machine scheduling with dynamic arrivals: decomposition results and an improved algorithm. Naval Research Logistics 43 (1996) 709-716
7. Chand S., Traub R., and Uzsoy R. Rolling horizon procedures for the single machine deterministic total completion time scheduling problem with release dates. Annals of Operations Research 70 (1997) 115-125
8. Chandra R. On n / 1 / over(F, -) dynamic deterministic systems. Naval Research Logistics 26 (1979) 537-544
9. Chekuri C., and Khanna S. Approximation algorithms for minimizing average weighted completion time. In: Leung J. (Ed). Chapter in Handbook of Scheduling: Algorithms, Models, and Performance Analysis (2004), CRC Press, Boca Raton, FL
10. Chu C. Efficient heuristics to minimize total flow time with release dates. Operations Research Letters 12 (1992) 321-330
11. Chu C. A branch and bound algorithm to minimize total flow time with unequal release dates. Naval Research Logistics 39 (1992) 859-875
12. Chung C.S., Flynn J., and Kirca O. A branch and bound algorithm to minimize the total flow time for m-machine permutation flowshop problems. International Journal of Production Economics 79 (2002) 185-196
13. Della Croce F., Narayan V., and Tadei R. The two-machine total completion time flowshop problem. European Journal of Operational Research 90 (1996) 227-237
14. Della Croce F., Ghirardi M., and Tadei R. An improved branch-and-bound algorithm for the two machine total completion time flowshop problem. European Journal of Operational Research 139 (2002) 293-301
15. Della Croce F., and T'kindt V. A recovering beam search algorithm for the one-machine dynamic total completion time scheduling problem. Journal of Operational Research Society 53 (2002) 1275-1280
16. Della Croce F., and T'kindt V. Improving the preemptive bound for the one-machine dynamic total completion time scheduling problem. Operations Research Letters 31 (2003) 142-148
17. Deogum D.S. On scheduling with ready times to minimize mean flowtime. Computer Journal 26 (1983) 320-328
18. Dessouky M.I., and Deogum D.S. Sequencing jobs with unequal ready times to minimize mean flowtime. SIAM Journal on Computing 10 (1981) 192-202
19. Framinan J.M., Leisten R., and Ruiz-Usano R. Comparison of heuristics for flowtime minimization in permutation flowshops. Computers and Operations Research 32 (2005) 1237-1254
20. Garey M.R., and Johnson D.S. Computers and Intractability: A Guide to the Theory of NP-Completeness (1979), Freeman, San Francisco, CA
21. Hall L.A. A polynomial approximation scheme for a constrained flow-shop scheduling problem. Mathematics of Operations Research 19 (1994) 68-85
22. Hoogeveen J.A., and Van de Velde S. Minimizing total completion and maximum cost simultaneously is solvable in polynomial time. Operations Research Letters 17 (1995) 205-208
23. Hoogeveen H., Van Norden L., and Van de Velde S. Lower bounds for minimizing total completion time in a two-machine flow shop. Journal of Scheduling 9 (2006) 559-568
24. Ignall E., and Schrage L. Application of the branch-and-bound technique to some flowshop scheduling problems. Operations Research 13 (1965) 400-412
25. Jouglet A., Savourey D., Carlier J., and Baptiste P. Dominance-based heuristics for one-machine total cost scheduling problems. European Journal of Operational Research 184 (2008) 879-899
26. j | C max. Operations Research Letters 20 (1997) 75-79
27. Ladhari T., and Haouari M. A computational study of the permutation flow shop problem based on a tight lower bound. Computers and Operations Research 32 (2005) 1831-1847
28. Lawler E.L., Lenstra J.K., Rinnooy Kan A.H.G., and Shmoys D.B. Sequencing and scheduling: algorithms and complexity. In: Graves C.G., Rinnooy Kan A.H.G., and Zipkin P. (Eds). Handbooks in Operations Research and Management Sciences Logistics of Production and Inventory vol. 4 (1993), North-Holland, Amsterdam 445-522
29. Liu J., and MacCarthy B.L. Effective heuristics for the single machine sequencing problem with ready times. International Journal of Production Research 29 (1991) 1521-1533
30. Murata T., Ishibuchi H., and Tanaka H. Genetic algorithms for flowshop scheduling problems. Computers and Industrial Engineering 30 4 (1996) 1061-1071
31. 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-96
32. Nowicki E., and Smutnicki C. A fast Tabu Search algorithm for the flow shop problem. European Journal of Operational Research 91 (1996) 160-175
33. Potts C.N. Analysis of heuristics for two-machine flow shop sequencing subject to release dates. Mathematics of Operations Research 10 (1985) 577-584
34. Reeves C. Heuristics for scheduling a single machine subject to unequal job release times. European Journal of Operational Research 80 (1995) 397-403
35. Reeves C., and Yamada T. Genetic algorithms, path relinking, and the flowshop sequencing problem. Evolutionary Computation 6 1 (1998) 45-60
36. Rinnooy Kan A.H.G. Machine Sequencing Problem: Classification, Complexity and Computation (1976), Nijhoff, The Hague
37. Smith W.E. Various optimizers for single stage production. Naval Research Logistics Quarterly 3 (1956) 59-66
38. Szwarc W. The flow shop problem with mean completion time criterion. IIE Transaction 15 (1983) 172-176
39. Tadei R., Gupta J.N.D., Della Croce F., and Cortesi M. Minimizing makespan in the two-machine flow-shop with release times. Journal of the Operational Research Society 49 1 (1998) 77-85
40. Taillard E. Some efficient heuristic methods for flow shop sequencing. European Journal of Operational Research 47 1 (1990) 65-74
41. Van de Velde S. Minimizing the sum of job completion times in the two-machine flowshop by Lagrangian relaxation. Annals of Operations Research 26 (1990) 257-268
42. i scheduling problems. International Journal of Production Economics 44 (1996) 225-237