Parallel machine problems with a single server are generalizations of classical parallel machine problems. Immediately before processing, each job must be loaded on a machine, which takes a certain set-up time. All these set-ups have to be done by a single server which can handle at most one job at
β¦ LIBER β¦
Parallel machine problems with a single server and release times
β Scribed by Shi Ling
- Book ID
- 105623374
- Publisher
- Springer
- Year
- 2005
- Tongue
- English
- Weight
- 249 KB
- Volume
- 8
- Category
- Article
- ISSN
- 1009-5020
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
Complexity results for parallel machine
β
Peter Brucker; Clarisse Dhaenens-Flipo; Sigrid Knust; Svetlana A. Kravchenko; Fr
π
Article
π
2002
π
Springer US
π
English
β 270 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 problems with equal pro
β
Svetlana A. Kravchenko; Frank Werner
π
Article
π
2011
π
Springer US
π
English
β 420 KB
Single machine scheduling problem with c
β
Byung-Cheon Choi; Suk-Hun Yoon; Sung-Jin Chung
π
Article
π
2007
π
Elsevier Science
π
English
β 181 KB
An approximation algorithm for a single-
β
Eugeniusz Nowicki; CzesΕaw Smutnicki
π
Article
π
1994
π
Elsevier Science
π
English
β 679 KB
Single-machine scheduling problems with
β
Xingong Zhang; Guangle Yan; Wanzhen Huang; Guochun Tang
π
Article
π
2011
π
Springer US
π
English
β 451 KB