Advanced search
Publication Cover
IIE Transactions Volume 28, 1996 - Issue 11: Scheduling and Logistics
Submit an article Journal homepage
8
Views
2
CrossRef citations to date
0
Altmetric
Original Articles

An Improved Lower Bound for the Changeover Scheduling Problem

James D. BlocherSchool of Business, Indiana University, Bloomington, IN47405, USAView further author information
&
Suresh ChandKrannert School of Management, Purdue University, West Lafayette, IN47907, USAView further author information
Pages 901-909 | Received 01 Nov 1993, Accepted 01 Jul 1995, Published online: 13 Sep 2016

References

  • Blocher, J.D. (1992) Single machine changeover scheduling. Ph.D. dissertation, Purdue University.
  • 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 Research91, 456–470.
  • 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.
  • 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.
  • 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.
  • Glassey, C.R. (1968) Minimum change-over scheduling of several products on one machine. Operations Research, 16, 342–352.
  • Magnanti, T.L. and Vachani, R. (1990) A strong cutting plane algorithm for production scheduling with changeover costs. Operations Research, 38(3), 456–473.
  • Mitsumori, S. (1972) Optimum production scheduling of multicommodity in flow line. IEEE Transactions, SMC2(9), 486–493.
  • 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.

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Order Reprints Request Corporate Permissions

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

Request Academic Permissions

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.

Related research

People also read lists articles that other readers of this article have read.

Recommended articles lists articles that we recommend and is powered by our AI driven recommendation engine.

Cited by lists all citing articles based on Crossref citations.
Articles with the Crossref icon will open in a new tab.