The paper considers scheduling problems for parallel dedicated machines subject to resource constraints. A fairly complete computational complexity classiΓΏcation is obtained, a number of polynomial-time algorithms are designed. For the problem with a ΓΏxed number of machines in which a job uses at mo
β¦ LIBER β¦
Scheduling parallel dedicated machines with the speeding-up resource
β Scribed by Hans Kellerer; Vitaly A. Strusevich
- Book ID
- 118285376
- Publisher
- John Wiley and Sons
- Year
- 2008
- Tongue
- English
- Weight
- 156 KB
- Volume
- 55
- Category
- Article
- ISSN
- 0894-069X
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
Scheduling problems for parallel dedicat
β
H. Kellerer; V.A. Strusevich
π
Article
π
2003
π
Elsevier Science
π
English
β 249 KB
Parallel dedicated machines scheduling w
β
Alessandro Agnetis; Hans Kellerer; Gaia Nicosia; Andrea Pacifici
π
Article
π
2012
π
Elsevier Science
π
English
β 445 KB
Scheduling for parallel dedicated machin
β
Celia A. Glass; Yakov M. Shafransky; Vitaly A. Strusevich
π
Article
π
2000
π
John Wiley and Sons
π
English
β 443 KB
π 1 views
This paper examines scheduling problems in which the setup phase of each operation needs to be attended by a single server, common for all jobs and different from the processing machines. The objective in each situation is to minimize the makespan. For the processing system consisting of two paralle
Parallel machine scheduling with flexibl
β
Emrah B. Edis; Ceyda Oguz
π
Article
π
2012
π
Elsevier Science
π
English
β 337 KB
Unrelated parallel machine scheduling wi
β
Jeng-Fung Chen
π
Article
π
2004
π
Springer
π
English
β 249 KB
Optimal scheduling of parallel machines
β
Konstantin Kogan
π
Article
π
2006
π
Elsevier Science
π
English
β 246 KB