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
β¦ LIBER β¦
Scheduling jobs on dynamic parallel machines with sequence-dependent setup times
β Scribed by Zne-Jung Lee; Shih-Wei Lin; Kuo-Ching Ying
- Publisher
- Springer
- Year
- 2009
- Tongue
- English
- Weight
- 190 KB
- Volume
- 47
- Category
- Article
- ISSN
- 0268-3768
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
Scheduling jobs on parallel machines wit
β
Young Hoon Lee; Michael Pinedo
π
Article
π
1997
π
Elsevier Science
π
English
β 855 KB
Scheduling Jobs on Parallel Machines wit
β
D.-H. Eom; H.-J. Shin; I.-H. Kwun; J.-K. Shim; S.-S. Kim
π
Article
π
2002
π
Springer
π
English
β 123 KB
Scheduling unrelated parallel machines w
β
RubΓ©n Ruiz; Carlos AndrΓ©s-Romano
π
Article
π
2011
π
Springer
π
English
β 468 KB
Scheduling with deteriorating jobs and p
β
Peng-Jen Lai; Wen-Chiung Lee; Hong-Hui Chen
π
Article
π
2010
π
Springer
π
English
β 132 KB
Due-date scheduling on parallel machines
β
Taeho Park; Taehyung Lee; Chang Ouk Kim
π
Article
π
2011
π
Springer
π
English
β 306 KB
Single machine scheduling with past-sequ
β
Chuanli Zhao; Hengyong Tang
π
Article
π
2010
π
Elsevier Science
π
English
β 180 KB
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