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 条
  • [1] Tighter Bounds on Preemptive Job Shop Scheduling with Two Machines
    E. J. Anderson
    T. S. Jayram
    T. Kimbrel
    [J]. Computing, 2001, 67 : 83 - 90
  • [2] LOWER BOUNDS FOR THE JOB-SHOP SCHEDULING PROBLEM ON MULTIPURPOSE MACHINES
    JURISCH, B
    [J]. DISCRETE APPLIED MATHEMATICS, 1995, 58 (02) : 145 - 156
  • [3] JOB SHOP SCHEDULING WITH ALTERNATIVE MACHINES
    NASR, N
    ELSAYED, EA
    [J]. INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 1990, 28 (09) : 1595 - 1609
  • [4] Resource constraints for preemptive job-shop scheduling
    Pape, Claude L.E.
    Baptiste, Philippe
    [J]. Constraints, 1998, 3 (04): : 263 - 287
  • [5] Resource constraints for preemptive job-shop scheduling
    Pape C.L.E.
    Baptiste P.
    [J]. Constraints, 1998, 3 (4) : 263 - 287
  • [6] An optimal method for the preemptive job shop scheduling problem
    Ebadi, Abbas
    Moslehi, Ghasem
    [J]. COMPUTERS & OPERATIONS RESEARCH, 2013, 40 (05) : 1314 - 1327
  • [7] Improved Bounds for Acyclic Job Shop Scheduling
    Uriel Feige
    Christian Scheideler
    [J]. Combinatorica, 2002, 22 : 361 - 399
  • [8] Improved bounds for acyclic job shop scheduling
    Feige, U
    Scheideler, C
    [J]. COMBINATORICA, 2002, 22 (03) : 361 - 399
  • [9] JOB-SHOP SCHEDULING WITH MULTIPURPOSE MACHINES
    BRUCKER, P
    SCHLIE, R
    [J]. COMPUTING, 1990, 45 (04) : 369 - 375
  • [10] Preemptive job-shop scheduling using stopwatch automata
    Abdeddaïm, Y
    Maler, O
    [J]. TOOLS AND ALGORITHMS FOR THE CONSTRUCTION AND ANAYLSIS OF SYSTEMS, PROCEEDINGS, 2002, 2280 : 113 - 126
12345