A review of lot streaming in a flow shop environment with makespan criteria <s> Lot Streaming in two-stage flow shop <s> Each of a collection of items are to be produced on two machines (or stages). Each machine can handle only one item at a time and each item must be processed through machine one and then through machine two. The setup time plus work time for each item for each machine is known. A simple decision rule is obtained in this paper for the optimal scheduling of the production so that the total elapsed time is a minimum. A three‐machine problem is also discussed and solved for a restricted case. <s> BIB001 </s> A review of lot streaming in a flow shop environment with makespan criteria <s> Lot Streaming in two-stage flow shop <s> Lot streaming is the process of splitting a job into sublots so that its operations can be overlapped. This paper deals with the problem of minimizing the length of a flow shop schedule when lot streaming is invoked. We show when it is sufficient in the one-job model to use the same sublot sizes for all machines, and we analyze the use of equal-sized sublots as a heuristic procedure. Finally, we demonstrate some of the difficulties involved in the n-job problem. <s> BIB002 </s> A review of lot streaming in a flow shop environment with makespan criteria <s> Lot Streaming in two-stage flow shop <s> Transfer batches permit the processing of part of a job-lot on downstream machines before completion of the lot on the current machine. This paper studies the effects of transfer batches in two- and three-machine flow shops. It establishes conditions under which each unit of a job can optimally be viewed as a separate transfer batch. Issues of interrupted versus continuous production on downstream machines, and job-splitting (lot-sizing) are discussed. Examples are provided which show that even with a regular measure of performance and no setup times, job-splitting can yield a better solution than is possible without splitting jobs. A modification of Johnson's Algorithm for makespan minimization is derived under suitable conditions in two-machine flow shops and in special three-machine flow shops. An empirical study of transfer batch effects in two-machine flow shops is undertaken for both the makespan and the total flow time criteria under the assumption that jobs are not split. The no-split jobs restric... <s> BIB003 </s> A review of lot streaming in a flow shop environment with makespan criteria <s> Lot Streaming in two-stage flow shop <s> Abstract Transfer batch scheduling permits the movement of some portion of a job or lot at downstream stages before the entire job is completed at the current stage. This paper considers the two stage flow shop problem of minimizing the total completion time, in which all transfer batches are of unit size for each job. An optimal solution procedure is developed for unit sized transfer batch scheduling with setup times which are independent of the sequence and are separated from the processing times at both stages. <s> BIB004 </s> A review of lot streaming in a flow shop environment with makespan criteria <s> Lot Streaming in two-stage flow shop <s> We present an overview of basic models and solution algorithms for the lot streaming problem. We include models with continuous and discrete sublot sizes, models with and without intermittent idling of machines, and models with consistent and variable sublots. We also introduce a model with limited transporter capacity. First we present solutions for two machines, then generalize to three machines and, where possible, to several machines. We synthesize previous research and introduce several new results. <s> BIB005 </s> A review of lot streaming in a flow shop environment with makespan criteria <s> Lot Streaming in two-stage flow shop <s> Lot streaming is moving some portion of a process batch ahead to begin a downstream operation. The problem to be considered in this paper is the following: a single job consisting of U units is to be processed on two machines in the given order. Given a fixed number of possible transfer batches between the two machines, the problem is to find the timing and the size of the transfer batches (or, sublots) so as to optimize a given criterion. The schedules can be evaluated based on job completion, sublot completion, or item completion times. In the single job lot streaming problem, minimizing job completion time corresponds to minimizing the makespan, for which formulas for optimal sublot sizes are available. In this paper, the results for the sublot and item completion time models are presented. <s> BIB006 </s> A review of lot streaming in a flow shop environment with makespan criteria <s> Lot Streaming in two-stage flow shop <s> We consider the problem of minimizing makespan in two-machine no-wait flowshops with multiple products requiring lot streaming. A “product” (or lot) consists of many identical items. Lot streaming (lot sizing) is the process of creating sublots (or transfer batches) to move the completed portion of a production sublot to downstream machines so that operations can be overlapped. The number of sublots for each product is fixed. When the flowshop produces only a single product, we obtain optimal continuous-sized sublots. It is shown that these sublot sizes are also optimal for the problem of simultaneous lot streaming and scheduling of multiple products. The optimal scheduling of products can be accomplished by application of the algorithm due to Gilmore and Gomory [1]. Then, we devise an efficient heuristic for the problem of simultaneous lot streaming (finding optimal integer-sized sublots) and scheduling of multiple products. Computational results indicate that this heuristic can consistently deliver close-to-optimal solutions for the problem. A comparison of this heuristic is also made with a heuristic that first divides items belonging to each product into nearly equal-sized sublots and then constructs a schedule for such sublots. Finally, we extend our solution procedures to a traditional and more general lot streaming model, where the number of sublots for each product is a decision variable. <s> BIB007 </s> A review of lot streaming in a flow shop environment with makespan criteria <s> Lot Streaming in two-stage flow shop <s> 22 leaves ; Includes bibliographical references (leaves 20-22). ; "April, 1995." ; This research was supported in part by the Natural Sciences and Engineering Research Council of Canada under Grant No.OGP0001798. <s> BIB008 </s> A review of lot streaming in a flow shop environment with makespan criteria <s> Lot Streaming in two-stage flow shop <s> Lot streaming—the process of splitting a production lot into sublots—has been a common practice in flow-shop systems during the past decade. Nevertheless, a major limiting assumption has been made in the analysis of these systems in that the setup time is, at most, lot-attached but not sublot-attached. In this paper, we consider the single and multiple batch flow-shop lot-streaming problems with sublot-attached setup times. A fast, optimal solution algorithm for the single batch problem is presented. For the multiple batch problem, we propose a near optimal solution procedure which is optimal in two-machine flow-shops. Computational results are also presented for the multiple batch problem which indicate both the efficiency and effectiveness of this procedure. <s> BIB009
The 2/*/E problem, with one or n jobs, it could be regarded as a simple sequence problem of equal sublots, using Johnson's rule BIB001 to find the optimal sequences in the twomachine. As it may be observed on Table 1 .1, only three problems have been founded. A single job problem with discrete values but not using setup times BIB006 . Other paper proposed an n job problem with continuous values BIB003 . Further analytical research was performed over the previous paper and sublot-attached setup -762-Journal of Industrial Engineering and Management -http://dx.doi.org/10. 3926/jiem.553 times were incorporated into the model  . Other authors considered setup times on the problem BIB004 BIB009 . For the 2/1/C using consistent sublots, the objective is to simply determine the optimal sublot sizes for all the machines. First paper on the matter with continuous values indicated when it was convenient the use of them BIB002 . Later on, different forms of the problem existing in the literature were reviewed and some important structural insights were generalized using both, continuous and discrete values BIB005 . Years later, a paper was presented for determining both, number of sublots and sublot sizes for a single job problem, and also for the n job one, considering setup times and a no-wait flowshop BIB007 . Previously, an analytical solution was provided using discrete values, to the problem when no setup times were considered BIB006 . Other authors used a network representation to analyze the structure of the optimal sublot allocation BIB008 . They proposed an efficient solution method based on the structural properties giving discrete results.