Some Optimum Algorithms for Scheduling Problems with Changeover Costs

T. C. Hu, Y. S. Kuo and F. Ruskey
Additional contact information
T. C. Hu: University of California, San Diego, La Jolla, California
Y. S. Kuo: National Chiao Tang University, Hsinchu, Taiwan
F. Ruskey: University of Victoria, Victoria, British Columbia

Operations Research, 1987, vol. 35, issue 1, 94-99

Abstract: We consider a production line that can produce one of n items per day. The demand schedule for all items is known in advance, and all items must be produced on or before their deadlines. We want a production schedule that meets all demand deadlines and minimizes the total changeover cost. The changeover cost has a special structure: it is (i) one dollar if the production line changes from producing item i to item j and i is less than j , and (ii) zero if i is greater than or equal to j . We also consider multiple identical production lines with all demands due at the end of every month, and assume that there is exactly enough demand at the end of every month. We obtain optimum production schedules for both the single-line and multiple-line case.

Keywords: 358 minimizing changeover costs in assembly lines; 581 scheduling for minimum set-up costs (search for similar items in EconPapers)
Date: 1987
References: Add references at CitEc
Citations: View citations in EconPapers (5)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.35.1.94 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:oropre:v:35:y:1987:i:1:p:94-99

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().