Sciweavers

Share
FSTTCS
2007
Springer

Order Scheduling Models: Hardness and Algorithms

9 years 1 months ago
Order Scheduling Models: Hardness and Algorithms
We consider scheduling problems in which a job consists of components of different types to be processed on m machines. Each machine is capable of processing components of a single type. Different components of a job are independent and can be processed in parallel on different machines. A job is considered as completed only when all its components have been completed. We study both completion time and flowtime aspects of such problems. We show both lowerbounds and upperbounds for the completion time problem. We first show that even the unweighted completion time with single release date is MAX-SNP hard. We give an approximation algorithm based on linear programming which has an approximation ratio of 3 for weighted completion time with multiple release dates. We give online algorithms for the weighted completion time which are constant factor competitive. For the flowtime, we give only lowerbounds in both the offline and online settings. We show that it is NP-hard to approximate...
Naveen Garg, Amit Kumar, Vinayaka Pandit
Added 07 Jun 2010
Updated 07 Jun 2010
Type Conference
Year 2007
Where FSTTCS
Authors Naveen Garg, Amit Kumar, Vinayaka Pandit
Comments (0)
books