A comparative study of lot streaming procedures

Kr Baker and D Jia

Omega, 1993, vol. 21, issue 5, 561-566

Abstract: We describe computational experiments with several algorithms for solving the lot streaming problem. Each of the algorithms optimizes the makespan under some set of constraints. For example, we can constrain the solution to have no idling, consistent sublots, equal sublots or equal sublots and no idling. Such constraints increase the makespan substantially over what is optimally possible, or they may have no impact at all. Our computational results for the three-machine problem provide a quantification of these relationships.

Keywords: prediction; scheduling; batch; production; flow-shop; materials; handling (search for similar items in EconPapers)
Date: 1993
References: Add references at CitEc
Citations: View citations in EconPapers (12)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/0305-0483(93)90024-F
Full text for ScienceDirect subscribers only

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:eee:jomega:v:21:y:1993:i:5:p:561-566

Ordering information: This journal article can be ordered from
http://www.elsevier.com/wps/find/supportfaq.cws_home/regional
https://shop.elsevie ... _01_ooc_1&version=01

Access Statistics for this article

Omega is currently edited by B. Lev

More articles in Omega from Elsevier
Bibliographic data for series maintained by Catherine Liu ().