## a b s t r a c t We consider a single-machine scheduling problem in which the processing time of each job is a simple linear deteriorating function of its waiting time. The machine is subject to an availability constraint. Jobs interrupted by machine unavailability can resume their processing. Th
โฆ LIBER โฆ
Minimizing the makespan with an availability constraint on a single machine under simple linear deterioration
โ Scribed by Chinyao Low; Chou-Jung Hsu; Chwen-Tzeng Su
- Book ID
- 108077224
- Publisher
- Elsevier Science
- Year
- 2008
- Tongue
- English
- Weight
- 384 KB
- Volume
- 56
- Category
- Article
- ISSN
- 0898-1221
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
Scheduling resumable simple linear deter
โ
Min Ji; T.C.E. Cheng
๐
Article
๐
2010
๐
Elsevier Science
๐
English
โ 194 KB
Scheduling linear deteriorating jobs to
โ
Chin-Chia Wu; Wen-Chiung Lee
๐
Article
๐
2003
๐
Elsevier Science
๐
English
โ 74 KB
The scheduling problem with deteriorating jobs to minimize the makespan on a single machine where the facility has an availability constraint is studied in this paper. By a deteriorating job we mean that the processing time for the job is a function of its starting time. Even with the introduction o
Minimizing the total weighted completion
โ
Chin-Chia Wu; Wen-Chiung Lee; Yau-Ren Shiau
๐
Article
๐
2006
๐
Springer
๐
English
โ 144 KB
A memetic algorithm for minimizing the t
โ
Jalil Layegh; Fariborz Jolai
๐
Article
๐
2010
๐
Elsevier Science
๐
English
โ 698 KB
Approximation algorithms for the makespa
โ
Imed Kacem
๐
Article
๐
2007
๐
Springer US
๐
English
โ 675 KB
Two simple constant ratio approximation
โ
Hans Kellerer; Mikhail A. Kubzin; Vitaly A. Strusevich
๐
Article
๐
2009
๐
Elsevier Science
๐
English
โ 205 KB