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 Parallel Machines with Sequence-Dependent Family Set-up Times
β Scribed by D.-H. Eom; H.-J. Shin; I.-H. Kwun; J.-K. Shim; S.-S. Kim
- Publisher
- Springer
- Year
- 2002
- Tongue
- English
- Weight
- 123 KB
- Volume
- 19
- 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 dynamic parallel mach
β
Zne-Jung Lee; Shih-Wei Lin; Kuo-Ching Ying
π
Article
π
2009
π
Springer
π
English
β 190 KB
Scheduling unrelated parallel machines w
β
RubΓ©n Ruiz; Carlos AndrΓ©s-Romano
π
Article
π
2011
π
Springer
π
English
β 468 KB
Scheduling identical jobs on uniform par
β
Mohamed I. Dessouky; Richard L. Marcellus; Li Zhang
π
Article
π
1998
π
Elsevier Science
π
English
β 261 KB
For the problem of scheduing identical jobs on a set of uniform parallel machines with random processing times, methods are given for optimizing the expected sum of weighted completion times and the probability of meeting a common due date.
Due-date scheduling on parallel machines
β
Taeho Park; Taehyung Lee; Chang Ouk Kim
π
Article
π
2011
π
Springer
π
English
β 306 KB
Scheduling on unrelated parallel machine
β
Jeng-Fung Chen
π
Article
π
2009
π
Springer
π
English
β 207 KB