Polynomial-time approximation schemes for scheduling problems with time lags |
| |
Authors: | Xiandong Zhang Steef van de Velde |
| |
Affiliation: | 1. Department of Management Science, School of Management, Fudan University, Shanghai, 200433, China 2. Rotterdam School of Management, Erasmus University, P.O. Box 1738, 3000 DR, Rotterdam, The Netherlands
|
| |
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. |
| |
Keywords: | |
本文献已被 SpringerLink 等数据库收录! |
|