A forward branch-and-search algorithm and forecast horizon results for the changeover scheduling problem

European Journal of Operational Research

Volumn 91, Issue 3, 1996, Pages 456-470

  Blocher, James D ^a   Chand, Suresh ^b  

^a INDIANA UNIVERSITY   (United States)

^b PURDUE UNIVERSITY   (United States)

Author keywords

Changeover scheduling; Forecast horizon

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; COMPUTATIONAL METHODS; OPERATIONS RESEARCH; OPTIMIZATION; PROBLEM SOLVING;

CHANGEOVER SCHEDULING; DISCRETE LOT SIZING AND SCHEDULING PROBLEM; EARLIEST DUE DATE SCHEDULE; FINITE CAPACITY RESOURCE; FORECAST HORIZON; FORWARD BRANCH AND SEARCH ALGORITHM;

SCHEDULING;

EID: 0030171487     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/0377-2217(95)00074-7     Document Type: Article

References (9)

1. Blocher, J.D. (1992), "Single machine scheduling changeover problem", Ph.D. Dissertation, Purdue University.
2. Bruno, J., and Downey, P. (1978), "Complexity of task sequencing with deadlines, setups and changeover costs", SIAM Journal on Computing 7, 393-404.
3. Chand, S. (1982), "A note on dynamic lot sizing in a rolling horizon environment", Decision Sciences 13, 113-119.
4. Glassey, C.R. (1968), "Minimum change-over scheduling of several products on one machine", Operations Research 16, 342-352.
5. Lee, C.-Y., and Denardo, E.V. (1986), "Rolling planning horizons: Error bounds for the dynamic lot size model", Mathematics of Operations Research 11, 423-432.
6. Lundin, R.A., and Morton, T.E., (1975) (1975), "Planning horizons for the dynamic lot size model: Zabel vs. protective procedures and computational results", Operations Research 23, 711-734.
7. Mitsumori, S. (1972), "Optimum production scheduling of multicommodity in flow line", IEEE Transactions 2, 486-493.
8. Salomon, M., Kroon, L.G. and Van Wassenhove, L.N. (1991), "Some extensions of the discrete lot sizing and scheduling problem", Management Science 37, 801-812.
9. Woodruff, D., and Spearman, M.L. (1992), "Sequencing and batching for two classes of job with deadlines and setup times", Production and Operations Management 1, 87-102.