Due window assignment and scheduling on parallel machines: a FPTAS for a bottleneck criterion

被引：2
|
作者：
Janiak, A. [1 ]
Janiak, W. [2 ]
Kovalyov, M. Y. [3 ]
机构：
[1] Polish Acad Sci, Syst Res Inst, PL-01447 Warsaw, Poland
[2] Int Univ Logist & Transport Wroclaw, PL-51168 Wroclaw, Poland
[3] Natl Acad Sci Belarus, United Inst Informat Problems, Minsk, BELARUS
来源：
BULLETIN OF THE POLISH ACADEMY OF SCIENCES-TECHNICAL SCIENCES | 2014年 / 62卷 / 04期
关键词：
fully polynomial time approximation scheme; scheduling; due window assignment;
D O I：
10.2478/bpasts-2014-0088
中图分类号：
T [工业技术];
学科分类号：
08 ;
摘要：
A fully polynomial time approximation scheme (FPTAS) with run time O(n(m)/epsilon(m-1)) is developed for a problem which combines common due window assignment and scheduling n jobs on m identical parallel machines. The problem criterion is bottleneck (min-max) such that the maximum cost, which includes job earliness, job tardiness and due window size costs, is minimized.
引用
收藏
页码：805 / 808
页数：4
相关论文
共 50 条
  • [1] Soft due window assignment and scheduling on parallel machines
    Janiak, Adam
    Kovalyov, Mikhail Y.
    Marek, Marcin
    [J]. IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS PART A-SYSTEMS AND HUMANS, 2007, 37 (05): : 614 - 620
  • [2] DUE WINDOW SCHEDULING FOR PARALLEL MACHINES
    KRAMER, FJ
    LEE, CY
    [J]. MATHEMATICAL AND COMPUTER MODELLING, 1994, 20 (02) : 69 - 89
  • [3] Soft due window assignment and scheduling of unit-time jobs on parallel machines
    Adam Janiak
    Wladyslaw Janiak
    Mikhail Y. Kovalyov
    Frank Werner
    [J]. 4OR, 2012, 10 : 347 - 360
  • [4] Soft due window assignment and scheduling of unit-time jobs on parallel machines
    Janiak, Adam
    Janiak, Wladyslaw
    Kovalyov, Mikhail Y.
    Werner, Frank
    [J]. 4OR-A QUARTERLY JOURNAL OF OPERATIONS RESEARCH, 2012, 10 (04): : 347 - 360
  • [5] Due-window assignment with identical jobs on parallel uniform machines
    Gerstl, Enrique
    Mosheiov, Gur
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2013, 229 (01) : 41 - 47
  • [6] A note: a due-window assignment problem on parallel identical machines
    Mosheiov, G.
    Sarig, A.
    [J]. JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 2011, 62 (01) : 238 - 241
  • [7] DUE-DATE ASSIGNMENT AND EARLY/TARDY SCHEDULING ON IDENTICAL PARALLEL MACHINES
    DE, P
    GHOSH, JB
    WELLS, CE
    [J]. NAVAL RESEARCH LOGISTICS, 1994, 41 (01) : 17 - 32
  • [8] A HEURISTIC FOR COMMON DUE-DATE ASSIGNMENT AND JOB SCHEDULING ON PARALLEL MACHINES
    CHENG, TCE
    [J]. JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 1989, 40 (12) : 1129 - 1135
  • [9] Error bound for common due date assignment and job scheduling on parallel machines
    Diamond, JE
    Cheng, TCE
    [J]. IIE TRANSACTIONS, 2000, 32 (05) : 445 - 448
  • [10] Approximation algorithms for common due date assignment and job scheduling on parallel machines
    Xiao, WG
    Li, CL
    [J]. IIE TRANSACTIONS, 2002, 34 (05) : 467 - 477
12345