Two-machine shop scheduling problems with batch processing

Authors:
Ulf Kleinau
Affiliations:
Technische Universität Magdeburg, Fakultät für Mathematik Institut für Mathematische Optimierung, PSF 124, O-3010 Magdeburg, Germany
Venue:
Mathematical and Computer Modelling: An International Journal
Year:
1993

Citing 4
Cited 2

Batching to minimize flow times on one machine

Management Science
One-pass batching algorithms for the one-machine problem

Discrete Applied Mathematics
Open Shop Scheduling to Minimize Finish Time

Journal of the ACM (JACM)
Scheduling groups of jobs in the two-machine flow shop

Mathematical and Computer Modelling: An International Journal

A comparison of heuristic algorithms for flow shop scheduling problems with setup times and limited batch size

Mathematical and Computer Modelling: An International Journal
Group technology approach to the open shop scheduling problem with batch setup times

Operations Research Letters

Quantified Score

Hi-index	0.98

Visualization

Abstract

We consider shop scheduling problems with group-technology. Groups of jobs are given to schedule them in a flow shop or open shop environment to minimize makespan. Setups have to be performed whenever two jobs of different groups are processed consecutively on the same machine. We show both problems to be NP-hard even in the two-machine case and give several algorithms for solving special cases of the open shop problem.