Şen, A.Topaloğlu, E.Benli, Ö.2015-07-282015-07-281998-10-010377-2217http://hdl.handle.net/11693/11058Lot 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. 0 1998 Elsevier Science B.V. All rights reserved.EnglishProductionScheduling theoryLot streamingFlow shopsArticle10.1016/S0377-2217(98)00203-3