๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Scheduling parallel machines with major and minor setup times

โœ Scribed by Wittrock, RobertJ.


Publisher
Springer
Year
1990
Tongue
English
Weight
706 KB
Volume
2
Category
Article
ISSN
0920-6299

No coin nor oath required. For personal study only.

โœฆ Synopsis


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.


๐Ÿ“œ SIMILAR VOLUMES


Scheduling jobs on parallel machines wit
โœ Young Hoon Lee; Michael Pinedo ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 855 KB

Consider a number of jobs to be processed on a number of identical machines in parallel. A job has a processing time, a weight and a due date. If a job is followed by another job, a setup time independent of the machine is incurred. A three phase heuristic is presented for minimizing the sum of the

Some unrelated parallel machine scheduli
โœ Wen-Hung Kuo; Chou-Jung Hsu; Dar-Li Yang ๐Ÿ“‚ Article ๐Ÿ“… 2011 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 205 KB

Total absolute deviation of job completion times Total load a b s t r a c t In this paper, we study an unrelated parallel machine scheduling problem with setup time and learning effects simultaneously. The setup time is proportional to the length of the already processed jobs. That is, the setup ti