user

Tighter Bounds on Preemptive Job Shop Scheduling with Two Machines

被引：0
|
作者：
E. J. Anderson
T. S. Jayram
T. Kimbrel
机构：
[1] Department of Computer Science and Engineering Box 352350 University of Washington Seattle,
[2] WA 98195-2350 USA e-mail: eric@cs.washington.edu,undefined
[3] IBM T.J. Watson Research Center PO Box 704 Yorktown Heights,undefined
[4] NY 10598 USA e-mail: jayram@watson.ibm.com,undefined
[5] IBM T.J. Watson Research Center PO Box 218 Yorktown Heights,undefined
[6] NY 10598 USA e-mail: kimbrel@watson.ibm.com,undefined
来源：
Computing | 2001年 / 67卷
关键词：
AMS Subject Classifications: 68Q25; 90B35.; Key Words: Approximation algorithm; scheduling; job shop; preemption.;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
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 Pmax/2 greater than the optimal schedule length, where Pmax is the length of the longest job.
引用
收藏
页码：83 / 90
页数：7
相关论文
共 50 条
  • [41] Preemptive scheduling on selfish machines
    Epsteini, Leah
    van Stee, Rob
    [J]. COMBINATORIAL AND ALGORITHMIC ASPECTS OF NETWORKING, 2007, 4852 : 57 - +
  • [42] Job shop scheduling problem with alternative machines using genetic algorithms
    I. A. Chaudhry
    [J]. Journal of Central South University, 2012, 19 : 1322 - 1333
  • [43] Hybrid metaheuristics for scheduling of machines and transport robots in job shop environment
    Nouri, Houssem Eddine
    Driss, Olfa Belkahla
    Ghedira, Khaled
    [J]. APPLIED INTELLIGENCE, 2016, 45 (03) : 808 - 828
  • [44] Hybrid metaheuristics for scheduling of machines and transport robots in job shop environment
    Houssem Eddine Nouri
    Olfa Belkahla Driss
    Khaled Ghédira
    [J]. Applied Intelligence, 2016, 45 : 808 - 828
  • [45] Performance of decomposition procedures for job shop scheduling problems with bottleneck machines
    Uzsoy, R
    Wang, CS
    [J]. INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 2000, 38 (06) : 1271 - 1286
  • [46] Model of Job Shop Scheduling Based on Graph Theory and Combination of Machines
    Wang, Feng
    Lin, Jie
    Liu, Xiao-hua
    [J]. 2008 CHINESE CONTROL AND DECISION CONFERENCE, VOLS 1-11, 2008, : 1056 - 1060
  • [47] TABU SEARCH FOR THE JOB-SHOP SCHEDULING PROBLEM WITH MULTIPURPOSE MACHINES
    HURINK, J
    JURISCH, B
    THOLE, M
    [J]. OR SPEKTRUM, 1994, 15 (04) : 205 - 215
  • [48] Study on Job Shop Scheduling with many function-same machines
    Xie, Zhiqiang
    Ye, Guangjie
    Liu, Yong
    Tan, Guangyu
    [J]. 2007 IEEE INTERNATIONAL CONFERENCE ON MECHATRONICS AND AUTOMATION, VOLS I-V, CONFERENCE PROCEEDINGS, 2007, : 1278 - 1282
  • [49] Job shop scheduling problem with alternative machines using genetic algorithms
    I.A.Chaudhry
    [J]. Journal of Central South University, 2012, 19 (05) : 1322 - 1333
  • [50] Two-stage ant colony algorithm based job shop scheduling with unrelated parallel machines
    [J]. Zhang, J. (zhangjie@sjtu.edu.cn), 1600, Chinese Mechanical Engineering Society (49):
12345