Models Arising from a Flexible Manufacturing Machine, Part II: Minimization of the Number of Switching Instants

Christopher S. Tang and Eric V. Denardo
Additional contact information
Christopher S. Tang: University of California, Los Angeles, California
Eric V. Denardo: Yale University, New Haven, Connecticut

Operations Research, 1988, vol. 36, issue 5, 778-784

Abstract: This paper deals with a job scheduling problem for a flexible manufacturing machine. We consider the same manufacturing environment described in a companion study (Part I), but we use a different performance criterion: to minimize the total number of instants at which tools are switched. This performance criterion is appropriate when the switching time is roughly constant and independent of the number of tool switches. We show that this scheduling problem generalizes the classical bin packing problem, and we present a non-LP-based branch-and-bound procedure that terminates with an optimal solution. We extend this procedure to the case of K machines in sequence.

Keywords: production/scheduling: material handling; programming: integer; algorithms; branch-and-bound (search for similar items in EconPapers)
Date: 1988
References: Add references at CitEc
Citations: View citations in EconPapers (27)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.36.5.778 (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:36:y:1988:i:5:p:778-784

Access Statistics for this article

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