Back to Search
Start Over
[Untitled]
- Source :
- Annals of Operations Research. 70:57-73
- Publication Year :
- 1997
- Publisher :
- Springer Science and Business Media LLC, 1997.
-
Abstract
- 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.
- Subjects :
- Rate-monotonic scheduling
Earliest deadline first scheduling
Open-shop scheduling
Trace scheduling
Computer science
Distributed computing
Scheduling (production processes)
General Decision Sciences
Dynamic priority scheduling
Management Science and Operations Research
Gang scheduling
Fair-share scheduling
Multiprocessor scheduling
Scheduling (computing)
Fixed-priority pre-emptive scheduling
Genetic algorithm scheduling
Nurse scheduling problem
Lottery scheduling
Computer Science::Operating Systems
Job shop scheduling
Instruction scheduling
Flow shop scheduling
Round-robin scheduling
Deadline-monotonic scheduling
Two-level scheduling
Minimum-cost flow problem
Subjects
Details
- ISSN :
- 02545330
- Volume :
- 70
- Database :
- OpenAIRE
- Journal :
- Annals of Operations Research
- Accession number :
- edsair.doi...........69d4aee52fbf21ddb017f57f039c33c8
- Full Text :
- https://doi.org/10.1023/a:1018950911030