The effect of machine availability on the worst-case performance of LPT
Authors:
- Hark-Chin HwangHHHark-Chin Hwang
- Kangbok LeeKLKangbok Lee
- Soo Y. ChangSCSoo Y. Chang
- 1 April 2005
- journal article
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 148 (1) , 49-61
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Makespan minimization for two parallel machines with an availability constraintEuropean Journal of Operational Research, 2005
- A note on “parallel machine scheduling with non-simultaneous machine available time”Discrete Applied Mathematics, 2000
- The worst-case analysis of the MULTIFIT algorithm for scheduling nonsimultaneous parallel machinesDiscrete Applied Mathematics, 1999
- Algorithms for multiprocessor scheduling with machine release timesIIE Transactions, 1998
- Parallel machines scheduling with machine shutdownsComputers & Mathematics with Applications, 1998
- Machine scheduling with an availability constraintJournal of Global Optimization, 1996
- Parallel machines scheduling with nonsimultaneous machine available timeDiscrete Applied Mathematics, 1991
- Using dual approximation algorithms for scheduling problems theoretical and practical resultsJournal of the ACM, 1987
- Tighter Bounds for the Multifit Processor Scheduling AlgorithmSIAM Journal on Computing, 1984
- An Application of Bin-Packing to Multiprocessor SchedulingSIAM Journal on Computing, 1978