Parallel machine scheduling with release dates, due dates and family setup times

International Journal of Production Economics

Volumn 46-47, Issue , 1996, Pages 119-125

  Schutten, J M J ^a   Leussink, R A M ^a  

^a UNIVERSITY OF TWENTE   (Netherlands)

Author keywords

Branch and bound; Family setup times; Maximum lateness; Parallel machines; Scheduling

Indexed keywords

ALGORITHMS; OPTIMIZATION; PROBLEM SOLVING;

BRANCH AND BOUND ALGORITHM; PARALLEL MACHINES;

SCHEDULING;

EID: 0030398342     PISSN: 09255273     EISSN: None     Source Type: Journal    
DOI: 10.1016/0925-5273(95)00086-0     Document Type: Article

References (12)

1. Deming, W.E., 1982. Quality, Productivity, and Competitive Position, MIT Center for Advanced Engineering Study, Cambridge, MA.
2. Blackburn, J.D., 1991. Time Based Competition, The Next Battle Ground in American Manufacturing. Richard D. Irwin, Homewood, IL
3. Garey, M.R. and Johnson, D.S., 1979. Computers and Intractability: A Guide to the Theory of NP-completeness. Freeman, San Francisco.
4. Bruno, J. and Downey, P., 1978. Complexity of task sequencing with deadlines, set-up times and changeover costs. SIAM J. Comput., 7: 393-404.
5. Graham, R.L., Lawler, E.L., Lenstra, J.K. and Rinnooy Kan. A.H.G., 1979. Optimization and approximation in deterministic sequencing and scheduling: A survey. Ann. Discrete Math. 5: 287-326.
6. Adams, J., Balas, E. and Zawack, D., 1988. The shifiting bottleneck procedure for job shop scheduling. Management Science, 34: 391-401.
7. Meester, G.J. and Zijm, W.H.M., 1994. Development of a shop floor control system for hybrid job shops. Technical report LPOM-94-1, Department of Mechanical Engineering, University of Twente, Enschede.
8. Schutten, J.M.J, van de Velde, S.L. and Zijm, W.H.M., 1993. Single-machine scheduling with release dates, due dates and family setup times. Management Science, Fothcoming.
9. Woerlee, A.P., 1991. Decision Support Systems for Production Scheduling. PhD thesis, Erasmus University, Rotterdam.
10. Carlier, J., 1987. Scheduling jobs with release dates and tails on identical machines to minimize the makespan. Eur. J. Oper. Res., 29: 298-306.
11. Horn, W.A., 1974. Some simple scheduling algorithms. Naval Res. Logist. Quar., 21: 177-185.
12. Labetoulle, J., Lawler, E.L., Lenstra, J.K. and Rinnooy Kan, A.G.H., 1984. Preemptive scheduling of uniform machines subject to release dates, in Progress in Combinatorial Optimization. Academic Press, Canada, pp. 245-261.