A Branch-and-Bound Algorithm for Two-Stage Production-Sequencing Problems

Ergin Uskup and Spencer B. Smith
Additional contact information
Ergin Uskup: Clow Corporation, Oak Brook, Illinois
Spencer B. Smith: Illinois Institute of Technology, Chicago, Illinois

Operations Research, 1975, vol. 23, issue 1, 118-136

Abstract: This paper presents an algorithm for determining an optimum solution to a two-stage production sequencing problem with these characteristics: There are n jobs to be sequenced in a two-stage production environment; each production stage is equipped with a single facility; jobs to be sequenced are subject to due-date constraints; facilities in both stages require setup prior to processing each job; setup times in both stages are sequence dependent, and setup cost is assumed to be directly proportional to setup time; and the optimal solution is one that minimizes the total setup cost (of stages I and II) without violating job-due dates. The algorithm employs controlled enumeration through branch-and-bound procedures, together with feasibility tests.

Date: 1975
References: Add references at CitEc
Citations: View citations in EconPapers (3)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.23.1.118 (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:23:y:1975:i:1:p:118-136

Access Statistics for this article

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