For the problem of scheduing identical jobs on a set of uniform parallel machines with random processing times, methods are given for optimizing the expected sum of weighted completion times and the probability of meeting a common due date.
β¦ LIBER β¦
Scheduling identical jobs on uniform parallel machines
β Scribed by M.I. Dessouky; B.J. Lageweg; J.K. Lenstra; S.L. van de Velde
- Book ID
- 115224998
- Publisher
- John Wiley and Sons
- Year
- 1990
- Tongue
- English
- Weight
- 465 KB
- Volume
- 44
- Category
- Article
- ISSN
- 0039-0402
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
Scheduling identical jobs on uniform par
β
Mohamed I. Dessouky; Richard L. Marcellus; Li Zhang
π
Article
π
1998
π
Elsevier Science
π
English
β 261 KB
Scheduling identical jobs with unequal r
β
Maged M. Dessouky
π
Article
π
1998
π
Elsevier Science
π
English
β 308 KB
AbstractΓWe consider the problem of scheduling n identical jobs with unequal ready times on m parallel uniform machines to minimize the maximum lateness. This paper develops a branch-and-bound procedure that optimally solves the problem and introduces six simple single-pass heuristic procedures that
Batch scheduling of identical jobs on pa
β
Baruch Mor; Gur Mosheiov
π
Article
π
2012
π
Elsevier Science
π
English
β 135 KB
Multistage hybrid flowshop scheduling wi
β
Sushil Verma; Maged Dessouky
π
Article
π
1999
π
Springer US
π
English
β 349 KB
Online scheduling of two type parallel j
β
Shou-wei Guo; Li-ying Kang
π
Article
π
2010
π
Chinese Electronic Periodical Services
π
English
β 142 KB
Scheduling stochastic jobs with increasi
β
Susan H. Xu; Srikanta P.R. Kumar; Pitu B. Mirchandani
π
Article
π
1992
π
Elsevier Science
π
English
β 977 KB