A Production Scheduling Problem with Sequencing Considerations

T. Prabhakar
Additional contact information
T. Prabhakar: Union Carbide Corporation, South Charleston, West Virginia

Management Science, 1974, vol. 21, issue 1, 34-42

Abstract: A type of production scheduling problem with sequencing considerations existing in several manufacturing facilities in chemical industry is formulated as a mixed integer programming problem and solved using a branch and bound search algorithm. The problem has two unusual sequencing aspects, namely, (1) a product to be sequenced can be split up amongst the reactors which, described in sequencing literature as job-splitting, is not usually allowed in machine sequencing problems and (2) the number of products to be sequenced on a given equipment as well as the product sequence need to be simultaneously determined. Some computational experience is reported.

Date: 1974
References: Add references at CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
http://dx.doi.org/10.1287/mnsc.21.1.34 (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:21:y:1974:i:1:p:34-42

Access Statistics for this article

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