Optimal Scheduling of Products with Two Subassemblies on a Single Machine

Edward G. Coffman, Ardavan Nozari and Mihalis Yannakakis
Additional contact information
Edward G. Coffman: AT&T Bell Laboratories, Murray Hill, New Jersey
Ardavan Nozari: Salomon Brothers, Inc., New York, New York
Mihalis Yannakakis: AT&T Bell Laboratories, Murray Hill, New Jersey

Operations Research, 1989, vol. 37, issue 3, 426-436

Abstract: We consider a single machine job shop in which subassemblies of two different types are made and then assembled into products. The time required for each type is known. A fixed changeover cost is incurred whenever the machine is switched over from one type to the other. We describe and analyze an efficient algorithm for minimizing the total flow time of the products. Applications to the automated manufacture of circuit boards are noted.

Keywords: production/scheduling: sequencing; deterministic; single machine (search for similar items in EconPapers)
Date: 1989
References: Add references at CitEc
Citations: View citations in EconPapers (21)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.37.3.426 (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:37:y:1989:i:3:p:426-436

Access Statistics for this article

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