MINIMIZING MAXIMUM COMPLETION TIME IN A TWO-BATCH-PROCESSING-MACHINE FLOWSHOP WITH DYNAMIC ARRIVALS ALLOWED

1 July 1997

journal article
research article
Published by Taylor & Francis in Engineering Optimization

Vol. 28 (3) , 231-243
https://doi.org/10.1080/03052159708941133

Abstract

This paper considers a scheduling problem concerned with a flowshop composed of two batch processing machines where a finite number of jobs arrive dynamically at the first machine of the flowshop. On each batch processing machine, jobs are processed in batch, and each batch is allowed to contain jobs possibly up to the maximum capacity of the associated machine. The objective is to find the optimal batching schedule which minimizes the maximum completion time of all jobs. In the analysis, several solution properties are characterized, based on which an efficient dynamic programming algorithm is developed.

Keywords

This publication has 11 references indexed in Scilit:

Scheduling a single batch processing machine with non-identical job sizes
International Journal of Production Research, 1994
Minimizing total completion time on batch processing machines
International Journal of Production Research, 1993
Minimizing total completion time on a batch processing machine with job families
Operations Research Letters, 1993
Efficient Algorithms for Scheduling Semiconductor Burn-In Operations
Operations Research, 1992
Batching and Scheduling Jobs on Batch and Discrete Processors
Operations Research, 1992
Dynamic batching heuristic for simultaneous processing
IEEE Transactions on Semiconductor Manufacturing, 1991
Batching to Minimize Flow Times on Parallel Heterogeneous Machines
Management Science, 1989
Batching to Minimize Flow Times on One Machine
Management Science, 1987
Efficient scheduling algorithms for a single batch processing machine
Operations Research Letters, 1986
Batching in single operation manufacturing systems
Operations Research Letters, 1985