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 identical parallel machines with unequal future ready time and sequence dependent setup: An experimental study
β Scribed by Yue Xi; Jaejin Jang
- Book ID
- 113655454
- Publisher
- Elsevier Science
- Year
- 2012
- Tongue
- English
- Weight
- 393 KB
- Volume
- 137
- Category
- Article
- ISSN
- 0925-5273
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 identical jobs with unequal r
β
Maged M. Dessouky
π
Article
π
1998
π
Elsevier Science
π
English
β 308 KB
AbstractΓWe consider the problem of scheduling n identical jobs with unequal ready times on m parallel uniform machines to minimize the maximum lateness. This paper develops a branch-and-bound procedure that optimally solves the problem and introduces six simple single-pass heuristic procedures that
Variable neighborhood search approaches
β
Rene Driessel; Lars MΓΆnch
π
Article
π
2011
π
Elsevier Science
π
English
β 377 KB
An efficient heuristic approach for para
β
YALAOUI, FAROUK; CHU, CHENGBIN
π
Article
π
2003
π
Taylor and Francis Group
π
English
β 148 KB
Due-date scheduling on parallel machines
β
Taeho Park; Taehyung Lee; Chang Ouk Kim
π
Article
π
2011
π
Springer
π
English
β 306 KB