Lotsizing and Scheduling on Parallel Machines with Sequence-Dependent Setup Costs

Sungmin Kang, Kavindra Malik and L. Joseph Thomas
Additional contact information
Sungmin Kang: Department of Business Administration, The Catholic University of Korea, Seoul 420-743, Korea
Kavindra Malik: i2 Technologies, 909 E. Las Colinas Boulevard, Irving, TX 75039
L. Joseph Thomas: Johnson Graduate School of Management, Cornell University, Ithaca, New York 14850

Management Science, 1999, vol. 45, issue 2, 273-289

Abstract: Industrial lotsizing and scheduling pose very difficult analytical problems. We propose an unconventional model that deals with sequence-dependent setup costs in a multiple-machine environment. The sequence-splitting model splits an entire schedule into subsequences, leading to tractable subproblems. An optimization approach based on a column generation/branch and bound methodology is developed, and heuristically adapted to test problems including five real-world problem instances gathered from industry.

Keywords: lotsizing; scheduling; sequence-dependent setup costs; column generation; branch and bound (search for similar items in EconPapers)
Date: 1999
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (23)

Downloads: (external link)
http://dx.doi.org/10.1287/mnsc.45.2.273 (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:ormnsc:v:45:y:1999:i:2:p:273-289

Access Statistics for this article

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