2004 | OriginalPaper | Chapter
Multi-Purpose Machines
Author : Professor Dr. Peter Brucker
Published in: Scheduling Algorithms
Publisher: Springer Berlin Heidelberg
Included in: Professional Book Archive
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
In a multi-purpose machine (MPM) model there is a set of machines µ i (µ ij ) ⊆ {M1,... , M m } associated with a job J i (operation O ij ). J i (O ij ) has to be processed by one machine in the set µ i (µ ij ). Thus, scheduling problems with multi-purpose machines combine assignment and scheduling problems: we have to schedule each job J i (operation O ij ) on exactly one machine from the set µ i (µ ij ).