Efficient state-independent sequencing rules for certain flexible manufacturing systems

Authors:
Arne Thesen
Affiliations:
Department of Industrial Engineering, University of Wisconsin-Madison, Madison, WI
Venue:
WSC '96 Proceedings of the 28th conference on Winter simulation
Year:
1996

Citing 3
Cited 0

Optimal dynamic routing in flexible manufacturing systems with limited buffers

Annals of Operations Research - Flexible Manufacturing Systems: Operations Research Models and Applications II
Scheduling networks of queues: heavy traffic analysis of a two-station network with controllable inputs

Operations Research
Simulation modeling using ProModel for windows

WSC '94 Proceedings of the 26th conference on Winter simulation

Quantified Score

Hi-index	0.00

Visualization

Abstract

We introduce three state-independent methods for sequencing production of parts with random processing times on a simple production system such that productivity is maximized. The system of interest is one where parts of several different types are first processed on a common machine after which they proceed to separate, type-specific production lines. Referred to as random, rotation, and most-behind the rules are all based on easily computed estimates of the optimal product mix for the given part routings. Extensions of these rules are shown to give close to optimal performance in the case where blocking is present. The rules differs from conventional sequencing heuristics in that their performance is excellent over a wide range of system parameter values. The rules differ from optimal, state-dependent, scheduling rules in that no rule base or information about the current system states is needed.