Most papers in the scheduling field assume that a job can be processed by only one machine at a time. Namely, they use a one-job-on-one-machine model. In many industry settings, this may not be an adequate model. Motivated by human resource planning, diagnosable microprocessor systems, berth allocat
Multiprocessor scheduling by generalized extremal optimization
β Scribed by Piotr Switalski; Franciszek Seredynski
- Book ID
- 106429637
- Publisher
- Springer US
- Year
- 2009
- Tongue
- English
- Weight
- 765 KB
- Volume
- 13
- Category
- Article
- ISSN
- 1094-6136
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
An optimal scheduling algorithm is described that feasibly schedules a set of m periodic tasks on n processors before their respective deadlines, if the task set satisfies certain conditions. The complexity of this scheduling algorithm in terms of the number of scheduled tasks and the number of proc
## Abstract This paper proposes a parallel optimization algorithm PDF/IHS for the minimum executionβtime multiprocessor scheduling problem which is a strong NPβhard optimization problem. PDF/IHS is a parallelization and efficient implementation of the only practical optimization algorithm DF/IHS am
Problems involving allocation of shared resources, such as sections of railway track, can often be solved efficiently using network optimization algorithms. In this paper we discuss a problem which involves scheduling different kinds of trains on a railway network consisting of a mix of double and s