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 条
  • [1] Polynomial-time approximation schemes for scheduling problems with time lags
    Xiandong Zhang
    Steef van de Velde
    Journal of Scheduling, 2010, 13 : 553 - 559
  • [2] Polynomial-Time Approximation Schemes for Circle Packing Problems
    Miyazawa, Flavio K.
    Pedrosa, Lehilton L. C.
    Schouery, Rafael C. S.
    Sviridenko, Maxim
    Wakabayashi, Yoshiko
    ALGORITHMS - ESA 2014, 2014, 8737 : 713 - 724
  • [3] On preemptive resource constrained scheduling: Polynomial-time approximation schemes
    Jansen, Klaus
    Porkolab, Lorant
    SIAM JOURNAL ON DISCRETE MATHEMATICS, 2006, 20 (03) : 545 - 563
  • [4] Polynomial-Time Approximation Schemes for Circle and Other Packing Problems
    Miyazawa, Flavio K.
    Pedrosa, Lehilton L. C.
    Schouery, Rafael C. S.
    Sviridenko, Maxim
    Wakabayashi, Yoshiko
    ALGORITHMICA, 2016, 76 (02) : 536 - 568
  • [5] Polynomial-Time Approximation Schemes for Circle and Other Packing Problems
    Flávio K. Miyazawa
    Lehilton L. C. Pedrosa
    Rafael C. S. Schouery
    Maxim Sviridenko
    Yoshiko Wakabayashi
    Algorithmica, 2016, 76 : 536 - 568
  • [6] Baker game and polynomial-time approximation schemes
    Dvorak, Zdenek
    PROCEEDINGS OF THE 2020 ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, SODA, 2020, : 2227 - 2240
  • [7] ON THE EXISTENCE OF POLYNOMIAL-TIME APPROXIMATION SCHEMES FOR THE REOPTIMIZATION OF DISCRETE OPTIMIZATION PROBLEMS
    Mikhailyuk, V. A.
    CYBERNETICS AND SYSTEMS ANALYSIS, 2011, 47 (03) : 368 - 374
  • [8] Baker game and polynomial-time approximation schemes
    Dvorak, Zdenek
    PROCEEDINGS OF THE THIRTY-FIRST ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS (SODA'20), 2020, : 2227 - 2240
  • [9] Polynomial-time approximation schemes for geometric graphs
    Erlebach, T
    Jansen, K
    Seidel, E
    PROCEEDINGS OF THE TWELFTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2001, : 671 - 679
  • [10] Polynomial-Time Approximation Schemes for a Class of Integrated Network Design and Scheduling Problems with Parallel Identical Machines
    Saito, Yusuke
    Shioura, Akiyoshi
    COMBINATORIAL OPTIMIZATION (ISCO 2022), 2022, 13526 : 324 - 335
12345