In a recent paper, Dror (1992) presented several results for openshop scheduling with machine dependent processing times. In this note, we present clarifications regarding the algorithm developed by him for minimizing the sum of job completion times (or average flow time) in a 2 machine openshop and
β¦ LIBER β¦
Openshop scheduling with machine dependent processing times
β Scribed by Moshe Dror
- Publisher
- Elsevier Science
- Year
- 1992
- Tongue
- English
- Weight
- 878 KB
- Volume
- 39
- Category
- Article
- ISSN
- 0166-218X
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
Two machine openshop scheduling with mac
β
Asoo J. Vakharia; BΓΌlent Γatay
π
Article
π
1997
π
Elsevier Science
π
English
β 408 KB
Parallel machine scheduling with time de
β
Zhi-Long Chen
π
Article
π
1996
π
Elsevier Science
π
English
β 598 KB
Hybrid flowshop scheduling with machine
β
J. Behnamian; S.M.T. Fatemi Ghomi
π
Article
π
2011
π
Elsevier Science
π
English
β 744 KB
Single machine batch scheduling with dea
β
T.C. Edwin Cheng; Mikhail Y. Kovalyov
π
Article
π
1995
π
Elsevier Science
π
English
β 519 KB
Single-machine scheduling with learning
β
Dan Wang; Ming-Zheng Wang; Ji-Bo Wang
π
Article
π
2010
π
Elsevier Science
π
English
β 206 KB
We consider resource allocation scheduling with learning effect in which the processing time of a job is a function of its position in a sequence and its resource allocation. The objective is to find the optimal sequence of jobs and the optimal resource allocation separately. We concentrate on two g
Single machine scheduling with start tim
β
P.S. Sundararaghavan; A.S. Kunnathur
π
Article
π
1994
π
Elsevier Science
π
English
β 554 KB