Polynomial-time approximation schemes for scheduling problems with time lags

Polynomial-time approximation schemes for scheduling problems with time lags

0.00 Avg rating0 Votes
Article ID: iaor20106372
Volume: 13
Issue: 5
Start Page Number: 553
End Page Number: 559
Publication Date: Oct 2010
Journal: Journal of Scheduling
Authors: ,
Abstract:

We identify two classes of machine scheduling problems with time lags that possess Polynomial-Time Approximation Schemes (PTASs). These classes together, one for minimizing makespan and one for minimizing total completion time, include many well-studied time lag scheduling problems. The running times of these approximation schemes are polynomial in the number of jobs, but exponential in the number of machines and the ratio between the largest time lag and the smallest positive operation time. These classes constitute the first PTAS results for scheduling problems with time lags.

Reviews

Required fields are marked *. Your email address will not be published.