Shop scheduling problems under precedence constraints

被引：0
|
作者：
V.A. Strusevich
机构：
来源：
Annals of Operations Research | 1997年 / 69卷
关键词：
Schedule Problem; Flow Shop; Precedence Constraint; Schedule Model; Open Shop;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
The paper considers a scheduling model that generalizes the well-known open shop, flow shop, and job shop models. For that model, called the super shop, we study the complexity of finding a time-optimal schedule in both preemptive and non-preemptive cases assuming that precedence constraints are imposed over the set of jobs. Two types of precedence rela-tions are considered. Most of the arising problems are proved to be NP-hard, while for some of them polynomial-time algorithms are presented.
引用
收藏
页码：351 / 377
页数：26
相关论文
共 50 条
  • [1] Shop scheduling problems under precedence constraints
    Strusevich, VA
    [J]. ANNALS OF OPERATIONS RESEARCH, 1997, 69 (0) : 351 - 377
  • [2] Flow Shop Scheduling Problems Under Machine–Dependent Precedence Constraints
    A.A. Gladky
    Y.M. Shafransky
    V.A. Strusevich
    [J]. Journal of Combinatorial Optimization, 2004, 8 : 13 - 28
  • [3] Flow shop scheduling problems under machine-dependent precedence constraints
    Gladky, AA
    Shafransky, YM
    Strusevich, VA
    [J]. JOURNAL OF COMBINATORIAL OPTIMIZATION, 2004, 8 (01) : 13 - 28
  • [4] Flexible job-shop scheduling problems with 'AND'/'OR' precedence constraints
    Lee, Sanghyup
    Moon, Ilkyeong
    Bae, Hyerim
    Kim, Jion
    [J]. INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 2012, 50 (07) : 1979 - 2001
  • [5] Open-Shop Scheduling for Unit Jobs Under Precedence Constraints
    Zhang, An
    Chen, Yong
    Goebel, Randy
    Lin, Guohui
    [J]. COMBINATORIAL OPTIMIZATION AND APPLICATIONS (COCOA 2018), 2018, 11346 : 329 - 340
  • [6] Open-shop scheduling for unit jobs under precedence constraints
    Chen, Yong
    Goebel, Randy
    Lin, Guohui
    Su, Bing
    Zhang, An
    [J]. THEORETICAL COMPUTER SCIENCE, 2020, 803 : 144 - 151
  • [7] Heuristic algorithms for job-shop scheduling problems with stochastic precedence constraints
    Neumann, K
    Schneider, WG
    [J]. ANNALS OF OPERATIONS RESEARCH, 1999, 92 (0) : 45 - 63
  • [8] Scheduling a flow shop to minimize the maximal lateness under arbitrary precedence constraints
    Jozefowska, J
    Zimniak, A
    [J]. INTERFACES IN COMPUTER SCIENCE AND OPERATIONS RESEARCH: ADVANCES IN METAHEURISTICS, OPTIMIZATION, AND STOCHASTIC MODELING TECHNOLOGIES, 1997, : 383 - 403
  • [9] COMPLEXITY OF SCHEDULING UNDER PRECEDENCE CONSTRAINTS
    LENSTRA, JK
    RINNOOYKAN, AHG
    [J]. OPERATIONS RESEARCH, 1978, 26 (01) : 22 - 35
  • [10] Uniprocessor Scheduling Under Precedence Constraints
    Mangeruca, L.
    Baleani, M.
    Ferrari, A.
    Sangiovanni-Vincentelli, A. L.
    [J]. PROCEEDINGS OF THE 12TH IEEE REAL-TIME AND EMBEDDED TECHNOLOGY AND APPLICATIONS SYMPOSIUM, 2006, : 157 - +
12345