Tighter bounds on preemptive job shop scheduling with two machines

被引：8
|
作者：
Anderson, EJ
Jayram, TS
Kimbrel, T
机构：
[1] Univ Washington, Dept Comp Sci & Engn, Seattle, WA 98195 USA
[2] IBM Corp, Thomas J Watson Res Ctr, Yorktown Hts, NY 10598 USA
来源：
COMPUTING | 2001年 / 67卷 / 01期
关键词：
approximation algorithm; scheduling; job shop; preemption;
D O I：
10.1007/s006070170017
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
We consider the preemptive job shop scheduling problem with two machines, with the objective to minimize the makespan. We present an algorithm that finds a schedule of length at most P-max/12 greater than the optimal schedule length, where P-max is the length of the longest job.
引用
收藏
页码：83 / 90
页数：8
相关论文
共 50 条
  • [31] On the Complexity of Non-preemptive Shop Scheduling with Two Jobs
    Tamás Kis
    [J]. Computing, 2002, 69 : 37 - 49
  • [32] Scheduling algorithm for flow shop with two batch-processing machines and arbitrary job sizes
    Cheng, Bayi
    Yang, Shanlin
    Hu, Xiaoxuan
    Li, Kai
    [J]. INTERNATIONAL JOURNAL OF SYSTEMS SCIENCE, 2014, 45 (03) : 571 - 578
  • [33] Solving Permutation Flow Shop Scheduling Problems with Job Idle Time in between Two Machines
    Baskar, A.
    Xavior, Anthony M.
    [J]. MATERIALS SCIENCE AND NANOTECHNOLOGY I, 2013, 531-532 : 699 - 702
  • [34] Flexible Job Shop Scheduling Problem Considering Upper Bounds for the Amount of Interruptions Between Operations and Machines Maintenance Activities
    Mahdavi K.
    Mohammadi M.
    Ahmadizar F.
    [J]. International Journal of Engineering, Transactions B: Applications, 2024, 37 (08): : 1600 - 1614
  • [35] Lagrangian bounds for just-in-time job-shop scheduling
    Baptiste, Philippe
    Flamini, Marta
    Sourd, Francis
    [J]. COMPUTERS & OPERATIONS RESEARCH, 2008, 35 (03) : 906 - 915
  • [36] Lower Bounds for Scheduling a Single Robot in a Job-Shop Environment
    Peter Brucker
    Sigrid Knust
    [J]. Annals of Operations Research, 2002, 115 : 147 - 172
  • [37] Flexible Job Shop Scheduling Problem Considering Upper Bounds for the Amount of Interruptions Between Operations and Machines Maintenance Activities
    Mahdavi, K.
    Mohammadi, M.
    Ahmadizar, F.
    [J]. INTERNATIONAL JOURNAL OF ENGINEERING, 2024, 37 (08): : 1600 - 1614
  • [38] Lower bounds for scheduling a single robot in a job-shop environment
    Brucker, P
    Knust, S
    [J]. ANNALS OF OPERATIONS RESEARCH, 2002, 115 (1-4) : 147 - 172
  • [39] Genetic algorithm with fuzzy logic controller for preemptive and non-preemptive job-shop scheduling problems
    Yun, YS
    [J]. COMPUTERS & INDUSTRIAL ENGINEERING, 2002, 43 (03) : 623 - 644
  • [40] Preemptive scheduling on selfish machines
    Epsteini, Leah
    van Stee, Rob
    [J]. COMBINATORIAL AND ALGORITHMIC ASPECTS OF NETWORKING, 2007, 4852 : 57 - +
12345