Back to Search
Start Over
A machine-order search space for job-shop scheduling problems
- Source :
- International Transactions in Operational Research. 10:597-610
- Publication Year :
- 2003
- Publisher :
- Wiley, 2003.
-
Abstract
- This paper proposes a methodology for real-time job-shop scheduling problems. It introduces a new classification of the scheduling methods for JSSPs with emphasis on the search methods and the significance of the search space. Subsequently, a machine-order search space is proposed as a new framework in which different single-machine scheduling algorithms and search methods can be incorporated to solve JSSPs. An optimization model relating makespan minimization and the proposed machine-order search space is also described. The proposed methodology finds an optimal solution by searching a proper machine order in the machine-order search space and scheduling the machines one by one in this order. Such an approach significantly reduces the size of the search space, and hence the computing efforts. As a result, scheduling of large JSSPs in real-time becomes practicable.
- Subjects :
- Rate-monotonic scheduling
Earliest deadline first scheduling
Mathematical optimization
Theoretical computer science
Job shop scheduling
Computer science
Strategy and Management
Dynamic priority scheduling
Flow shop scheduling
Management Science and Operations Research
Fair-share scheduling
Computer Science Applications
Management of Technology and Innovation
Two-level scheduling
Beam search
Business and International Management
Subjects
Details
- ISSN :
- 14753995 and 09696016
- Volume :
- 10
- Database :
- OpenAIRE
- Journal :
- International Transactions in Operational Research
- Accession number :
- edsair.doi...........f246f009d9f14240c0f204a1048641a3