This paper considers single machine scheduling problems with setup times and deteriorating jobs. The setup times are proportional to the length of the already processed jobs, that is, the setup times are past-sequence-dependent (p-s-d). It is assumed that the job processing times are defined by func
β¦ LIBER β¦
Scheduling with deteriorating jobs and past-sequence-dependent setup times
β Scribed by Peng-Jen Lai; Wen-Chiung Lee; Hong-Hui Chen
- Publisher
- Springer
- Year
- 2010
- Tongue
- English
- Weight
- 132 KB
- Volume
- 54
- Category
- Article
- ISSN
- 0268-3768
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
Single machine scheduling with past-sequ
β
Chuanli Zhao; Hengyong Tang
π
Article
π
2010
π
Elsevier Science
π
English
β 180 KB
Deteriorating jobs and learning effects
β
Na Yin; Ji-Bo Wang; Dan Wang; Li-Yan Wang; Xiao-Yuan Wang
π
Article
π
2009
π
Springer
π
English
β 261 KB
Comments on βDeteriorating jobs and lear
β
Dehua Xu; Na Yin; Ji-Bo Wang
π
Article
π
2011
π
Springer
π
English
β 171 KB
Note to: Deteriorating jobs and learning
β
Xue Huang
π
Article
π
2011
π
Springer
π
English
β 169 KB
A note on deteriorating jobs and learnin
β
Peng Shen; Cai-Min Wei; Yu-Bin Wu
π
Article
π
2011
π
Springer
π
English
β 184 KB
Scheduling jobs on parallel machines wit
β
Young Hoon Lee; Michael Pinedo
π
Article
π
1997
π
Elsevier Science
π
English
β 855 KB
Consider a number of jobs to be processed on a number of identical machines in parallel. A job has a processing time, a weight and a due date. If a job is followed by another job, a setup time independent of the machine is incurred. A three phase heuristic is presented for minimizing the sum of the