Efficient heuristic and optimal approaches for n/2/F/ΣCi scheduling problems

International Journal of Production Economics

Volumn 44, Issue 3, 1996, Pages 225-237

  Wang, Chengen ^b   Chu, Chengbin ^a   Proth, Jean Marie ^a  

^a INRIA   (France)

^b Technopôle Metz 2 000 ^*

Author keywords

Branch and bound algorithm; Flow shop; Heuristic method; Job completion time; Scheduling

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; COMPUTATIONAL METHODS; HEURISTIC METHODS; MATHEMATICAL TECHNIQUES; NUMERICAL ANALYSIS; PRODUCTION ENGINEERING; SCHEDULING;

BRANCH AND BOUND ALGORITHMS; JOB COMPLETION TIME; JOB TWO MACHINE FLOW SHOP; OPTIMAL SCHEDULES; SEARCH SPACE;

OPTIMIZATION;

EID: 0030182364     PISSN: 09255273     EISSN: None     Source Type: Journal    
DOI: 10.1016/0925-5273(96)00060-6     Document Type: Article

References (14)

1. Blazewicz, J., Ecker, K., Schmidt, G. and Weglarz, J., 1993. Scheduling in Computer and Manufacturing Systems. Springer, Berlin.
2. Van Deman, J.M. and Baker, K.R., 1973. Minimizing mean flowtime in the flow shop with no intermediate queues. AIIE Trans., 6: 28-34.
3. Panwalkar, S.S. and Woollam, C.R., 1980. Ordered Flow Shop Problems with no In-process Waiting: Further Results. J. Oper. Res. Soc., 31: 1039-1043.
4. Adiri, I. and Pohoryles, D., 1982. Flowshop/no-idle or no-wait scheduling to minimize the sum of completion times. Naval Res. Logist. Quart., 29: 495-504.
5. Adiri, I. and Amit, N., 1984. Openshop and flowshop scheduling to minimize sum of completion times. Comput. Oper. Res., 11: 275-284.
6. Chu, C., 1992. Efficient heuristics to minimize total flow time with release dates. Oper. Res. Lett., 12: 321-330.
7. Ignall, E. and Scharge L., 1965. Application of the branch and bound technique to some flow-shop scheduling problems. Oper. Res., 13: 400-412.
8. Chandra, R., 1979. On n/1/F̄ dynamic deterministic problems. Naval Res. Logist. Quart., 26: 537-544.
9. Chu, C., 1992. A branch-and-bound algorithm to minimize total flow time with unequal release times. Naval Res. Logist., 39: 859-875.
10. Dessouky, M.I. and Deogun, J.S., 1981. Sequencing jobs with unequal ready times to minimize mean flow time, SIAM J. Comput., 10: 207-227.
11. Hariri, A.M. and Potts, C.N., 1983. An algorithm for single machine sequencing with release times to minimize total weighted completion time. Discrete Appl. Math., 5: 99-109.
12. Posner, M.E., 1985. Minimizing weighted completion times with deadlines. Oper. Res., 33: 562-574.
13. Ahmadi, R.H. and Bagchi, U., 1990. Lower bounds for single machine scheduling problems. Naval Res. Logist., 37: 967-979.
14. Bianco, L. and Racciardelli, S., 1982. Scheduling of single machine to minimize total weighted completion time subject to release dates. Naval Res. Logist. Quart., 29: 151-167.