We consider a single-machine problem of scheduling n independent jobs to minimize makespan, in which the processing time of job J j grows by w j with each time unit its start is delayed beyond a given common critical date d. This processing time is p j if J j starts by d. We show that this problem i
โฆ LIBER โฆ
Scheduling linear deteriorating jobs to minimize the number of tardy jobs
โ Scribed by Abbasali Jafari, Ghasem Moslehi
- Book ID
- 118802462
- Publisher
- Springer US
- Year
- 2011
- Tongue
- English
- Weight
- 255 KB
- Volume
- 54
- Category
- Article
- ISSN
- 0925-5001
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
Scheduling deteriorating jobs to minimiz
โ
Wieslaw Kubiak; Steef van de Velde
๐
Article
๐
1998
๐
John Wiley and Sons
๐
English
โ 83 KB
Two-Machine Flowshop Scheduling to Minim
โ
J. N. D. Gupta and A. M. A. Hariri
๐
Article
๐
1997
๐
Palgrave Publishers Ltd.
๐
English
โ 341 KB
Group scheduling with deteriorating jobs
โ
Wen-Chiung Lee; Zon-Syun Lu
๐
Article
๐
2012
๐
Elsevier Science
๐
English
โ 186 KB
Minimizing the number of tardy jobs unde
โ
Ghasem Moslehi; Abbasali Jafari
๐
Article
๐
2010
๐
Elsevier Science
๐
English
โ 343 KB
In this paper, we consider a single machine scheduling problem with piecewise-linear deterioration where its objective is to minimize the number of tardy jobs, in which the processing time of each job depends on its starting time where all the jobs have a specific deterioration rate. The problem is
Single-machine scheduling to minimize ea
โ
T. C. E. Cheng; H. G. Kahlbacher
๐
Article
๐
1993
๐
Springer
๐
English
โ 605 KB
Single-machine parallel-batching schedul
โ
Li, Shi-Sheng; Chen, Ren-Xia
๐
Article
๐
2014
๐
Elsevier Science
๐
English
โ 347 KB