Article
Cited 33 time in 
Cited 30 time in 
Cited 30 time in
Metadata Downloads
Parallel machines scheduling with machine shutdowns SCIE SCOPUS
- Title
- Parallel machines scheduling with machine shutdowns
- Date Issued
- 1998-08
- Publisher
- PERGAMON-ELSEVIER SCIENCE LTD
- Abstract
- We study the nonpreemptive parallel machines scheduling problem where some of the machines are planned to be shutdown. We apply LPT algorithm to the problem and analyze its performance. Our analysis shows that the makespan of the LPT schedule is bounded by twice the optimum makespan if no more than half of the machines are allowed to be shutdown simultaneously. We also show that this bound is tight by constructing a worst-case example. (C) 1998 Elsevier Science Ltd. All rights reserved.
- Keywords
- parallel machines scheduling; machine shutdowns; longest processing time (LPT); algorithm
- ISSN
- 0898-1221
- Article Type
- Article
- Citation
- COMPUTERS & MATHEMATICS WITH APPLICATIONS, vol. 36, no. 3, page. 21 - 31, 1998-08
- Files in This Item:
- There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.