Scheduling and dispatching: scheduling batch processing machines in complex job shops

Authors:
Kasin Oey;Scott J. Mason
Affiliations:
University of Arkansas, Fayetteville, AR;University of Arkansas, Fayetteville, AR
Venue:
Proceedings of the 33nd conference on Winter simulation
Year:
2001

Citing 4
Cited 0

The shifting bottleneck procedure for job shop scheduling

Management Science
Batching and scheduling jobs on batch and discrete processors

Operations Research
The one-machine problem with delayed precedence constraints and its use in job shop scheduling

Management Science
Minimizing total weighted tardiness in complex job shops

Minimizing total weighted tardiness in complex job shops

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper considers a complex job shop problem with reentrant flow and batch processing machines. A modified shifting bottleneck heuristic (MSB) is considered for generating machine schedules to minimize the total weighted tardiness. We observe that the MSB could produce infeasible schedules where cyclic schedules are found. A cycle elimination procedure is proposed to remove the possibility of the MSB generating cyclic schedules in the solution.