2001
DOI: 10.1111/j.1540-5915.2001.tb00964.x
|View full text |Cite
|
Sign up to set email alerts
|

Optimal Solutions for the Single Batch, Flow Shop, Lot‐streaming Problem with Equal Sublots

Abstract: Lot streaming is the process of splitting a production lot into sublots and then scheduling the sublots in overlapping fashion on the machines in order to improve the performance of the production system. Implementation of this concept arises in several batch production environments. These include, among others, printed circuit board assembly and semiconductor fabrication. There are several limitations in the lot-streaming models available in the literature which affect their usefulness in reality. In this pap… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
12
0

Year Published

2002
2002
2020
2020

Publication Types

Select...
7

Relationship

0
7

Authors

Journals

citations
Cited by 27 publications
(12 citation statements)
references
References 9 publications
0
12
0
Order By: Relevance
“…The solutions obtained by our SMB procedure were compared to those obtained in Kalir and Sarin (2001), where the m-machine flow-shop problem was investigated with the restriction that the sublot sizes are equal. Given this restriction only one decision variable exists namely the number of sublots (or equivalently -the sublot size) and the optimal continuous solution may be obtained by a closed-form formula.…”
Section: Smb Resultsmentioning
confidence: 99%
See 2 more Smart Citations
“…The solutions obtained by our SMB procedure were compared to those obtained in Kalir and Sarin (2001), where the m-machine flow-shop problem was investigated with the restriction that the sublot sizes are equal. Given this restriction only one decision variable exists namely the number of sublots (or equivalently -the sublot size) and the optimal continuous solution may be obtained by a closed-form formula.…”
Section: Smb Resultsmentioning
confidence: 99%
“…Kropp and Smunt (1990) consider the multi-machine flow-shop where the number of sublots is given and a setup time exists for starting the first sublot only; the problem is solved using a quadratic programming approach. The work of Kalir and Sarin (2001) deals with the lot streaming problem for minimizing the mean flow-time in a flow-shop environment where a setup is attached to every sublot and the sublot sizes are restricted to be equal. A closed-form formula for the number of sublots and the sublot sizes is presented in the continuous case and an algorithm for solving the discrete problem is developed.…”
Section: Introduction and Literature Reviewmentioning
confidence: 99%
See 1 more Smart Citation
“…A large variation of lot streaming models has been proposed, depending on the constraints of the environment that one wishes to model: e.g., it may be assumed that all sublots have to be of equal size (as in Jacobs andBragg 1988, Kalir andSarin 2001), and/or it may be imposed that sublots have to be consistent throughout the system, implying that the same sublot sizes have to be used at each machine (as in Van Nieuwenhuyse and Vandaele 2004). The primary objective of these papers is to determine the optimal lot streaming procedure in order to minimize either the process batch makespan (e.g.…”
Section: Introductionmentioning
confidence: 99%
“…The primary objective of these papers is to determine the optimal lot streaming procedure in order to minimize either the process batch makespan (e.g. Chen and Steiner 1996, Chen and Steiner 1998, Cheng et al 2000, mean transfer batch flow time (Kalir and Sarin 2001, Sen et al 1998, Bukchin et al 2002, Van Nieuwenhuyse and Vandaele 2004, or a combination of both (Bukchin and Masin 2004) in such an environment.…”
Section: Introductionmentioning
confidence: 99%