Lot streaming in three-stage production processes
type: Item
instance of: scholarly article
title: Lot streaming in three-stage production processes
zbMATH Open document ID: 0824.90079
DOI: 10.1016/0377-2217(94)90082-5
author: C. A. Glass
author: Jatinder N. D. Gupta
author: Chris N. Potts
published in: European Journal of Operational Research
publication date: 1995-11-09T00:00:00Z
review text: Lot streaming models for multi-stage production systems with the makespan (maximum completion time) as an objective are considered. A single job is to be partitioned into \(s\) sublots. A machine, which processes the job on the concrete stage, can process a sublot only when it has finished processing any previous sublot and when all sublots at any previous stage which contain items of the current sublot have been processed. Let \(p_ i\) denote the positive processing time of the job on stage \(i\) and let \(x_{ij}\) denote the proportion of processing on stage \(i\) of sublot \(j\). Thus, the processing time of sublot \(j\) is \(p_ i x_{ij}\). Throughout the paper the case when \(x_{ij}= x_{i+ 1,j}= x_ j\) for all \(1\leq i\leq m- 1\) and \(1\leq j\leq s\) is considered. Here \(x_{ij}\) and \(x_{i+ 1,j}\) is supposed to contain the same items of the job. The authors suggest algorithms for three-stage flow and job shop problems. They find a minimum makespan value in \(O(\log s)\) time and optimal sublot sizes and optimal schedules in \(O(s)\) time. For open shop problems the results are as follows. If \(s\geq m\), then minimum makespan value may be found in \(O(m)\) time (it is equal to \(\max\{p_ 1,\dots, p_ m\}\)) optimal sublot sizes are \(1/m\) for \(1\leq j\leq m\) and 0 for \(m< j\leq s\), and an optimal schedule may be found in \(O(ms)\) time. For \(s= 2\) optimal sublot sizes both are 1/2, the minimum makespan value and the optimal schedule may be found in \(O(m)\) time.
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90B30
Mathematics Subject Classification ID: 90C60
zbMATH DE Number: 622631
zbMATH Keywords: lot streaming
zbMATH Keywords: multi-stage production systems
zbMATH Keywords: makespan
zbMATH Keywords: three-stage flow
zbMATH Keywords: job shop
reviewed by: Ya. M. Shafransky
MaRDI profile type: Publication
full work available at URL: 0377-2217(94)90082-5
OpenAlex ID: W2079636010
cites work: Sequencing theory
cites work: Open Shop Scheduling to Minimize Finish Time
cites work: Note—Note on “Manufacturing Cycle Time Determination for a Multi-Stage Economic Production Quantity Model”
cites work: Optimal and Heuristic Procedures for Component Lot-Splitting in Multi-Stage Manufacturing Systems
cites work: A concise survey of efficiently solvable special cases of the permutation flow-shop problem
cites work: Flow shop scheduling with lot streaming
cites work: Integrating Scheduling with Batching and Lot-Sizing: A Review of Algorithms and Complexity
cites work: Manufacturing Cycle Time Determination for a Multi-Stage Economic Production Quantity Model
cites work: Basic Techniques for Lot Streaming
cites work: Two- and three-machine flow shop scheduling problems with equal sized transfer batches
description: scientific article; zbMATH DE number 622631