The Changeover Scheduling Problem with Time and Cost Considerations: Analytical Results and a Forward Algorithm

References

• Aronson J. E., Thompson G. L. A survey on forward methods in mathematical programming. Large Scale Systems7:1–16Google Scholar
• Blocher J. D., Chand S. An improved lower bound for the changeover scheduling problem. IIE Trans. (1996a) 28:901–909Crossref, Google Scholar
• Blocher J. D., Chand S. A forward branch-and-search algorithm and forecast horizon results for the changeover scheduling problem. Eur. J. Oper. Res. (1996b) 91:456–470Crossref, Google Scholar
• Bruno J., Downey P. Complexity of task sequencing with deadlines, set-up times, and changeover costs. SIAM J. Comput. (1978) 7:393–404Crossref, Google Scholar
• Cattrysse D., Salomon M., Kuik R., VanWassenhove L. N. A dual ascent and column generation heuristic for the discrete lot-sizing and scheduling problem with setup times. Management Sci. (1993) 39:477–486Link, Google Scholar
• Driscoll W. C., Emmons H. Scheduling production on one machine with changeover costs. AIIE Trans. (1977) 9:388–395Crossref, Google Scholar
• Gershwin S.Manufacturing Systems Engineering (1994) (Prentice-Hall, New York) Google Scholar
• Glassey C. R. Minimum change-over scheduling of several products on one machine. Oper. Res. (1968) 16:342–352Link, Google Scholar
• Magnanti T. L., Vachani R. A strong cutting plane algorithm for production scheduling with changeover costs. Oper. Res. (1990) 38:456–473Link, Google Scholar
• Mitsumori S. Optimum production scheduling of multicommodity in flow line. IEEE Trans. SMC (1972) 2:486–493Crossref, Google Scholar
• Mitsumori S. Optimum scheduling for load balance of twomachine production lines. IEEE Trans.–SMC (1981) 11:400–409Crossref, Google Scholar
• Morton T. E. Forward algorithms for forward thinking managers. Appl. Management Sci. (1981) 1:1–55Google Scholar