A NOTE ON THE COMPLEXITY OF OPENSHOP SCHEDULING PROBLEMS

被引：0
|
作者：
KUBIAK, W
SRISKANDARAJAH, C
ZARAS, K
机构：
来源：
INFOR | 1991年 / 29卷 / 04期
关键词：
OPENSHOP SCHEDULING; FINISH TIME; MEAN FLOW TIME; TOTAL WEIGHTED TARDINESS; MAXIMUM LATENESS; NUMBER OF LATE JOBS; NP-HARD; NP-COMPLETE;
D O I：
暂无
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
We investigate the complexity of openshop scheduling problems. A number of variations of the shop with different objective functions have been surveyed. The problem of minimizing mean flow time in no-wait openshop as well as the problem of minimizing the number of late jobs for preemptive schedules are shown to be NP-hard. An O(n log n) time algorithm for minimizing the total weighted number of late jobs in no-wait openshop is provided.
引用
收藏
页码：284 / 294
页数：11
相关论文
共 50 条
  • [1] ON THE COMPLEXITY OF PREEMPTIVE OPENSHOP SCHEDULING PROBLEMS
    SRISKANDARAJAH, C
    WAGNEUR, E
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1994, 77 (03) : 404 - 414
  • [2] A historical note on the complexity of scheduling problems
    Lenstra, Jan Karel
    Strusevich, Vitaly A.
    Vlach, Milan
    [J]. OPERATIONS RESEARCH LETTERS, 2023, 51 (01) : 1 - 2
  • [3] A note on the complexity of two supply chain scheduling problems
    Zhang, Yuan
    Yuan, Jinjiang
    [J]. JOURNAL OF SCHEDULING, 2021, 24 (04) : 447 - 454
  • [4] A note on the complexity of scheduling problems with linear job deterioration
    Koulamas, Christos
    Panwalkar, S. S.
    [J]. JOURNAL OF GLOBAL OPTIMIZATION, 2015, 62 (02) : 409 - 410
  • [5] A note on the complexity of two supply chain scheduling problems
    Yuan Zhang
    Jinjiang Yuan
    [J]. Journal of Scheduling, 2021, 24 : 447 - 454
  • [6] A note on the complexity of scheduling problems with linear job deterioration
    Christos Koulamas
    S. S. Panwalkar
    [J]. Journal of Global Optimization, 2015, 62 : 409 - 410
  • [7] Openshop scheduling under linear resources constraints
    Adiri, I
    Hamberg, O
    [J]. NAVAL RESEARCH LOGISTICS, 1998, 45 (01) : 51 - 66
  • [8] OPENSHOP SCHEDULING WITH MACHINE DEPENDENT PROCESSING TIMES
    DROR, M
    [J]. DISCRETE APPLIED MATHEMATICS, 1992, 39 (03) : 197 - 205
  • [9] Printed circuit board scheduling in an openshop manufacturing environment
    Çatay, Bülent
    Vakharia, Asoo J.
    Erengüç, S. Selçuk
    [J]. International Journal of Advanced Manufacturing Technology, 2006, 29 (9-10): : 980 - 989
  • [10] Printed circuit board scheduling in an openshop manufacturing environment
    Bülent Çatay
    Asoo J. Vakharia
    S. Selçuk Erengüç
    [J]. The International Journal of Advanced Manufacturing Technology, 2006, 29 : 980 - 989
12345