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

James D. Blocher, Suresh Chand and Kaushik Sengupta
Additional contact information
James D. Blocher: Kelley School of Business, Indiana University, 1309 East Tenth Street, Bloomington, Indiana 47405
Suresh Chand: Krannert School of Management, Purdue University, West Lafayette, Indiana 47907
Kaushik Sengupta: i2 Technologies, 1055 Parsippany Blvd., Suite 210, Parsippany, New Jersey 07054

Operations Research, 1999, vol. 47, issue 4, 559-569

Abstract: In a multiproduct, discrete-item manufacturing environment, it is often more economical to have one “flexible” machine to produce several products rather than to have a dedicated machine for the production of each product. We consider the problem of scheduling multiple products on a single-finite-capacity resource when faced with product-dependent, but sequence-independent, changeover costs and times. The problem horizon is assumed finite and the demand time-varying and known over this horizon. The objective is to find a feasible schedule that meets all demand on time and minimizes the total changeover cost.With the “delivery-on-time-or-else” mentality and the trend toward shorter order-to-delivery lead times, scheduling and managing changeovers has become just that much more important. We first present analytical results to reduce the feasible solution space and then develop a branch-and-bound algorithm to solve this NP-complete problem. Computational results are presented that show that the algorithm can solve realistic size problems in a reasonable amount of time.

Keywords: production/scheduling; sequencing; deterministic; single machine; changeover costs and times (search for similar items in EconPapers)
Date: 1999
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (3)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.47.4.559 (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:47:y:1999:i:4:p:559-569

Access Statistics for this article

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