An improved lower bound for the changeover scheduling problem

IIE Transactions (Institute of Industrial Engineers)

Volumn 28, Issue 11, 1996, Pages 901-909

  Blocher, James D ^a   Chand, Suresh ^b  

^a INDIANA UNIVERSITY   (United States)

^b PURDUE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; CALCULATIONS; COST ACCOUNTING; OPTIMIZATION; PRODUCTION CONTROL; PRODUCTION ENGINEERING;

SCHEDULING;

EID: 0030287710     PISSN: 0740817X     EISSN: None     Source Type: Journal    
DOI: 10.1080/15458830.1996.11770743     Document Type: Article

References (9)

1. Blocher, J.D. (1992) Single machine changeover scheduling. Ph.D. dissertation, Purdue University.
2. Blocher, J.D. and Chand, S. (1996) A forward branch-and-search algorithm and forecast horizon results for the changeover scheduling problem. European Journal of Operational Research 91, 456-470.
3. Bruno, J. and Downey, P. (1978) Complexity of task sequencing with deadlines, setup times, and changeover costs. Society for Industrial and Applied Mathematics Journal of Computing, 7, 393-404.
4. Cattrysse, D., Salomon, M., Kuik, R. and Van Wassenhove, L.N. (1993) A dual ascent and column generation heuristic for the discrete lotsizing and scheduling problem with setup times. Management Science, 39, 477-486.
5. Gascon, A. and Leachman, R. (1988) A dynamic programming solution to the dynamic, multi-item, single-machine scheduling problem. Operations Research, 36(1), 50-56.
6. Glassey, C.R. (1968) Minimum change-over scheduling of several products on one machine. Operations Research, 16, 342-352.
7. Magnanti, T.L. and Vachani, R. (1990) A strong cutting plane algorithm for production scheduling with changeover costs. Operations Research, 38(3), 456-473.
8. Mitsumori, S. (1972) Optimum production scheduling of multicom-modity in flow line. IEEE Transactions, SMC2(9), 486-493.
9. Salomon, M., Kroon, L.G., Kuik, R. and Van Wassenhove, L.N. (1991) Some extensions of the discrete lotsizing and scheduling problem. Management Science, 37, 801-812.