Polynomial-time approximation schemes for scheduling problems with time lags

被引：4

作者：

Zhang, Xiandong ^{[1
]}

van de Velde, Steef ^{[2
]}

机构：

[1] Fudan Univ, Dept Management Sci, Sch Management, Shanghai 200433, Peoples R China

[2] Erasmus Univ, Rotterdam Sch Management, NL-3000 DR Rotterdam, Netherlands

来源：

JOURNAL OF SCHEDULING | 2010年 / 13卷 / 05期

基金：

中国国家自然科学基金;

关键词：

Machine scheduling; Time lags; Approximability; Polynomial-Time Approximation Scheme (PTAS); 2-MACHINE FLOW-SHOP; TRANSPORTATION TIMES; 2; MACHINES; DELAYS; OPERATIONS; JOBS;

D O I：

10.1007/s10951-009-0134-8

中图分类号：

T [工业技术];

学科分类号：

08 ;

摘要：

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.

引用

页码：553 / 559

页数：7

共 50 条

[31] Polynomial-Time Approximation Schemes for Subset-Connectivity Problems in Bounded-Genus Graphs
Borradaile, Glencora
Demaine, Erik D.
Tazari, Siamak
ALGORITHMICA, 2014, 68 (02) : 287 - 311
[32] Polynomial-time approximation schemes for the Euclidean survivable network design problem
Czumaj, A
Lingas, A
Zhao, HR
AUTOMATA, LANGUAGES AND PROGRAMMING, 2002, 2380 : 973 - 984
[33] Fully polynomial-time approximation schemes for time-cost tradeoff problems in series-parallel project networks
Halman, Nir
Li, Chung-Lun
Simchi-Levi, David
OPERATIONS RESEARCH LETTERS, 2009, 37 (04) : 239 - 244
[34] Polynomial-time approximation schemes for piercing and covering with applications in wireless networks
Carmi, Paz
Katz, Matthew J.
Lev-Tov, Nissan
COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS, 2008, 39 (03): : 209 - 218
[35] Polynomial-time word problems
Schleimer, Saul
COMMENTARII MATHEMATICI HELVETICI, 2008, 83 (04) : 741 - 765
[36] Fully Polynomial Time Approximation Schemes for Scheduling Divisible Loads
Berlinska, Joanna
PARALLEL PROCESSING AND APPLIED MATHEMATICS, PART II, 2010, 6068 : 1 - 10
[37] Linear time approximation schemes for vehicle scheduling problems
Augustine, JE
Seiden, S
THEORETICAL COMPUTER SCIENCE, 2004, 324 (2-3) : 147 - 160
[38] Polynomial-time approximation schemes for geometric min-sum median clustering
Ostrovsky, R
Rabani, Y
JOURNAL OF THE ACM, 2002, 49 (02) : 139 - 156
[39] Scheduling malleable parallel tasks: An asymptotic fully polynomial-time approximation scheme
Jansen, K
ALGORITHMS-ESA 2002, PROCEEDINGS, 2002, 2461 : 562 - 573
[40] Polynomial time approximation schemes for minimum disk cover problems
Chen Liao
Shiyan Hu
Journal of Combinatorial Optimization, 2010, 20 : 399 - 412

← 1 2 3 4 5 →