1997
DOI: 10.1016/s0377-2217(96)00091-4
|View full text |Cite
|
Sign up to set email alerts
|

Lot streaming with detached setups in three-machine flow shops

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
9
0

Year Published

1999
1999
2018
2018

Publication Types

Select...
7
2

Relationship

1
8

Authors

Journals

citations
Cited by 42 publications
(9 citation statements)
references
References 19 publications
0
9
0
Order By: Relevance
“…[9] develop directly the continuous solution to minimize the makespan for a single job in a three-stage production process, by analyzing the structure of the optimal solution. These results are extended by Chen and Steiner, in [6] and [7], to the case with detached and attached job setup times. Cetinkaya and Gupta [4] solve the continuous lot streaming problem for a single job in a flow shop with the total flow time criterion.…”
Section: Introductionmentioning
confidence: 65%
“…[9] develop directly the continuous solution to minimize the makespan for a single job in a three-stage production process, by analyzing the structure of the optimal solution. These results are extended by Chen and Steiner, in [6] and [7], to the case with detached and attached job setup times. Cetinkaya and Gupta [4] solve the continuous lot streaming problem for a single job in a flow shop with the total flow time criterion.…”
Section: Introductionmentioning
confidence: 65%
“…Years later, no-wait condition was added to the problem (Wagneur, 2001). Other authors extended to the case containing detached (Chen & Steiner, 1997a) and attached (Chen & Steiner, 1998) setup times. For the case of m/1/C/CV, it was extended a previous work (Sriskandarajah & Wagneur, 1999) and it was used genetic algorithm (GA) to solve problems in which fixed and variable numbers of sublots for each product were included (Kumar, Bagchi & Sriskandarajah, 2000).…”
Section: Lot Streaming In M-stage Flow Shopmentioning
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%