Polynomial algorithms for resource-constrained and multiprocessor task scheduling problems

被引:41
|
作者
Brucker, P
Kramer, A
机构
[1] Universität Osnabrück, Fachbereich Mathematik / Informatik
关键词
scheduling; resource-constrained scheduling; multiprocessor scheduling; job shop; flow shop;
D O I
10.1016/0377-2217(95)00350-9
中图分类号
C93 [管理学];
学科分类号
12 ; 1201 ; 1202 ; 120202 ;
摘要
Resource-constrained scheduling problems with a fixed number of task types are considered in which, in addition, either the processing times are bounded or the number of processors is fixed. For problems with makespan, (weighted) mean now time, weighted number of tardy tasks, and sum of tardiness as objective functions polynomial time algorithms are presented. These algorithms generalize results derived by Blaiewicz ct al. (1989) for makespan problems and solve open problems listed by Hoogeveen et al. (1994). Furthermore, results for shop problems with multiprocessor tasks and unit processing times, in which either the number of jobs or the number of stages is fixed, are derived.
引用
收藏
页码:214 / 226
页数:13
相关论文
共 50 条
  • [1] Review of Resource-Constrained Scheduling Algorithms
    Franco-Duran, Diana M.
    de la Garza, Jesus M.
    [J]. JOURNAL OF CONSTRUCTION ENGINEERING AND MANAGEMENT, 2019, 145 (11)
  • [2] NEW PSEUDO POLYNOMIAL ALGORITHMS FOR A PARTIAL RESOURCE-CONSTRAINED PROJECT SCHEDULING PROBLEM
    Wei, Hanying
    Su, Zhixiong
    Qi, Jianxun
    [J]. JOURNAL OF INDUSTRIAL AND MANAGEMENT OPTIMIZATION, 2023, 19 (11) : 8271 - 8298
  • [3] Research on task scheduling algorithm in resource-constrained environments
    Lu, Chengzhao
    Gong, Jianxing
    Zhu, Lei
    Liu, Quan
    [J]. Xi Tong Gong Cheng Yu Dian Zi Ji Shu/Systems Engineering and Electronics, 2021, 43 (12): : 3586 - 3593
  • [4] Resource-constrained scheduling of partitioned algorithms on processor arrays
    Dion, M
    Risset, T
    Robert, Y
    [J]. INTEGRATION-THE VLSI JOURNAL, 1996, 20 (02) : 139 - 159
  • [5] Flexible Scheduling Approach for Resource-Constrained Project Scheduling Problems
    Liu, Shixin
    Tukel, Oya I.
    Rom, W.
    [J]. 2008 7TH WORLD CONGRESS ON INTELLIGENT CONTROL AND AUTOMATION, VOLS 1-23, 2008, : 3522 - +
  • [6] A polynomial algorithm for some preemptive multiprocessor task scheduling problems
    Kuszner, Lukasz
    Malafiejski, Michal
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2007, 176 (01) : 145 - 150
  • [7] Genetic algorithms to solve resource-constrained project scheduling problems with variable activity durations
    Sebt, M. H.
    Zarandi, M. H. Fazel
    Alipouri, Y.
    [J]. INTERNATIONAL JOURNAL OF CIVIL ENGINEERING, 2013, 11 (3A) : 189 - 198
  • [8] MILP Formulation for Resource-Constrained Project Scheduling Problems
    Kyriakidis, Thomas S.
    Kopanos, Georgios M.
    Georgiadis, Michael C.
    [J]. 21ST EUROPEAN SYMPOSIUM ON COMPUTER AIDED PROCESS ENGINEERING, 2011, 29 : 880 - 884
  • [9] SMT encodings for Resource-Constrained Project Scheduling Problems
    Bofill, Miquel
    Coll, Jordi
    Suy, Josep
    Villaret, Mateu
    [J]. COMPUTERS & INDUSTRIAL ENGINEERING, 2020, 149
  • [10] A Hybrid Programming Framework for Resource-Constrained Scheduling Problems
    Sitek, Pawel
    Wikarek, Jaroslaw
    [J]. INTELLIGENT DATA ENGINEERING AND AUTOMATED LEARNING - IDEAL 2015, 2015, 9375 : 300 - 308