New complexity results for shop scheduling problems with agreement graphs

被引:1
|
作者
Tellache, Nour ElHouda [1 ,2 ]
机构
[1] Ecole Ponts ParisTech, CERMICS, F-77455 Marne La Vallee 2, France
[2] USTHB Univ, RECITS Lab, BP 32 El Alia, Algiers, Algeria
关键词
Scheduling; Complexity; Flow shop; Open shop; Makespan; Agreement graphs;
D O I
10.1016/j.tcs.2021.07.037
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
We investigate the problem of scheduling jobs on open shop and flow shop systems of two machines, subject to the constraints that only some jobs can be scheduled simultaneously on different machines. These constraints are given by a simple undirected graph G, called the agreement graph. The objective is to minimize the makespan. We first show that the open shop problem with two distinct values of release times is NP-hard even for operation sizes in {1, 2} and we present a restricted case that can be solved in polynomial time. Then, we consider the problem with null release times and we show that when restricted to arbitrary trees, the problem is NP-hard. We also present a linear algorithm when restricted to caterpillars and we show that this algorithm can be used to solve the case of cycles in polynomial time. For the flow shop problem, we show that the problem is NP-hard for trees and that this result holds even if the preemption is allowed. (C) 2021 Elsevier B.V. All rights reserved.
引用
收藏
页码:85 / 95
页数:11
相关论文
共 50 条
  • [1] The complexity of cyclic shop scheduling problems
    Hall, NG
    Lee, TE
    Posner, ME
    [J]. JOURNAL OF SCHEDULING, 2002, 5 (04) : 307 - 327
  • [2] Complexity Results for Flow-Shop and Open-Shop Scheduling Problems with Transportation Delays
    Peter Brucker
    Sigrid Knust
    T.C. Edwin Cheng
    Natalia V. Shakhlevich
    [J]. Annals of Operations Research, 2004, 129 : 81 - 106
  • [3] Complexity results for flow-shop and open-shop scheduling problems with transportation delays
    Brucker, P
    Knust, S
    Cheng, TCE
    Shakhlevich, NV
    [J]. ANNALS OF OPERATIONS RESEARCH, 2004, 129 (1-4) : 81 - 106
  • [4] New results in two identical machines scheduling with agreement graphs
    Mohabeddine, Amine
    Boudhar, Mourad
    [J]. THEORETICAL COMPUTER SCIENCE, 2019, 779 : 37 - 46
  • [5] Open shop scheduling problems with conflict graphs
    Tellache, Nour El Houda
    Boudhar, Mourad
    [J]. DISCRETE APPLIED MATHEMATICS, 2017, 227 : 103 - 120
  • [6] Complexity of mixed shop scheduling problems: A survey
    Shakhlevich, NV
    Sotskov, YN
    Werner, F
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2000, 120 (02) : 343 - 351
  • [7] New results for flow shop and parallel machine scheduling problems
    Chan, LMA
    Kaminsky, P
    Muriel, A
    Simchi-Levi, D
    [J]. PROCEEDINGS OF THE 1996 MSOM CONFERENCE, 1996, : 213 - 218
  • [8] ON THE COMPLEXITY OF PREEMPTIVE OPEN-SHOP SCHEDULING PROBLEMS
    LIU, CY
    BULFIN, RL
    [J]. OPERATIONS RESEARCH LETTERS, 1985, 4 (02) : 71 - 74
  • [9] Complexity of flow shop scheduling problems with transportation constraints
    Soukhal, A
    Oulamara, A
    Martineau, P
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2005, 161 (01) : 32 - 41
  • [10] Flexible Job Shop Scheduling Problems with Arbitrary Precedence Graphs
    Kasapidis, Gregory A.
    Paraskevopoulos, Dimitris C.
    Repoussis, Panagiotis P.
    Tarantilis, Christos D.
    [J]. PRODUCTION AND OPERATIONS MANAGEMENT, 2021, 30 (11) : 4044 - 4068