Publication
International Journal of Flexible Manufacturing Systems
Paper

Scheduling parallel machines with major and minor setup times

View publication

Abstract

This article discusses the problem of scheduling a large set of parts on an FMS so as to minimize the total completion time. Here, the FMS consists of a set of parallel identical machines. Setup time is incurred whenever a machine switches from one type of part to another. The setup time may be large or small depending on whether or not the two part types belong to the same family. This article describes a fast heuristic for this scheduling problem and derives a lower bound on the optimal solution. In computational tests using random data and data from an IBM card test line, the heuristic archieves nearly optimal schedules. © 1990 Kluwer Academic Publishers.

Date

01 Jul 1990

Publication

International Journal of Flexible Manufacturing Systems

Authors

Share