Complexity of scheduling problems with multi-purpose machines

Autor(en): Brucker, P
Jurisch, B
Kramer, A
Stichwörter: ALGORITHM; JOBS; MULTIPURPOSE MACHINES; Operations Research & Management Science; SHOP; TIME
Erscheinungsdatum: 1997
Herausgeber: BALTZER SCI PUBL BV
Journal: ANNALS OF OPERATIONS RESEARCH
Volumen: 70
Startseite: 57
Seitenende: 73
Zusammenfassung: 
In a multi-purpose machine scheduling problem, jobs or operations can be processed by any machine of prespecified subsets of the machine set. In this paper, we study the computational complexity of such scheduling problems. We study scheduling problems with identical and uniform machines as well as problems with shop characteristics.
ISSN: 02545330
DOI: 10.1023/A:1018950911030

Show full item record

Page view(s)

8
Last Week
0
Last month
0
checked on Feb 22, 2024

Google ScholarTM

Check

Altmetric