A new formulation for scheduling unrelated processor under precedence constraints

被引：3
|
作者：
Maculan, N
Porto, SCS
Ribeiro, CC
de Souza, CC
机构：
[1] Univ Fed Rio de Janeiro, COPPE, BR-21945970 Rio De Janeiro, Brazil
[2] Univ Fed Fluminense, Dept Telecommun Engn, BR-24210 Niteroi, RJ, Brazil
[3] Pontificia Univ Catolica Rio de Janeiro, Dept Informat, BR-22453900 Rio De Janeiro, Brazil
[4] Univ Estadual Campinas, Dept Ciencia Comp, BR-13081 Campinas, Brazil
来源：
RAIRO-RECHERCHE OPERATIONNELLE-OPERATIONS RESEARCH | 1999年 / 33卷 / 01期
关键词：
parallel processing; scheduling; unrelated processors; precedence constraints; makespan;
D O I：
10.1051/ro:1999106
中图分类号：
C93 [管理学]; O22 [运筹学];
学科分类号：
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要：
We give a new formulation for the problem of task scheduling into unrelated processors under precedence constraints. This formulation has a polynomial number of variables variables and does not require that the processing times be integer valued.
引用
收藏
页码：87 / 92
页数：6
相关论文
共 50 条
  • [21] Online Linear Optimization for Job Scheduling Under Precedence Constraints
    Fujita, Takahiro
    Hatano, Kohei
    Kijima, Shuji
    Takimoto, Eiji
    ALGORITHMIC LEARNING THEORY, ALT 2015, 2015, 9355 : 332 - 346
  • [22] Unrelated Parallel Machine Scheduling Problem with Precedence Constraints: Polyhedral Analysis and Branch-and-Cut
    Hassan, Mohammed-Albarra
    Kacem, Imed
    Martin, Sebastien
    Osman, Izzeldin M.
    COMBINATORIAL OPTIMIZATION, ISCO 2016, 2016, 9849 : 308 - 319
  • [23] A Hybrid Genetic Algorithm to Minimize Total Tardiness for Unrelated Parallel Machine Scheduling with Precedence Constraints
    Liu, Chunfeng
    MATHEMATICAL PROBLEMS IN ENGINEERING, 2013, 2013
  • [24] An Approximation Algorithm for Scheduling Malleable Tasks under General Precedence Constraints
    Jansen, Klaus
    Zhang, Hu
    ACM TRANSACTIONS ON ALGORITHMS, 2006, 2 (03) : 416 - 434
  • [25] Flow Shop Scheduling Problems Under Machine–Dependent Precedence Constraints
    A.A. Gladky
    Y.M. Shafransky
    V.A. Strusevich
    Journal of Combinatorial Optimization, 2004, 8 : 13 - 28
  • [26] DYNAMIC SCHEDULING OF REAL-TIME TASKS UNDER PRECEDENCE CONSTRAINTS
    CHETTO, H
    SILLY, M
    BOUCHENTOUF, T
    REAL-TIME SYSTEMS, 1990, 2 (03) : 181 - 194
  • [27] Open-Shop Scheduling for Unit Jobs Under Precedence Constraints
    Zhang, An
    Chen, Yong
    Goebel, Randy
    Lin, Guohui
    COMBINATORIAL OPTIMIZATION AND APPLICATIONS (COCOA 2018), 2018, 11346 : 329 - 340
  • [28] Open-shop scheduling for unit jobs under precedence constraints
    Chen, Yong
    Goebel, Randy
    Lin, Guohui
    Su, Bing
    Zhang, An
    THEORETICAL COMPUTER SCIENCE, 2020, 803 : 144 - 151
  • [29] Efficient Precedence-Based Multistage Batch Scheduling Formulation with Nontrivial Tightening Constraints
    Marchetti, Pablo A.
    Cerda, Jaime
    27TH EUROPEAN SYMPOSIUM ON COMPUTER AIDED PROCESS ENGINEERING, PT B, 2017, 40B : 1429 - 1434
  • [30] THE PARALLEL COMPLEXITY OF SCHEDULING WITH PRECEDENCE CONSTRAINTS
    DOLEV, D
    UPFAL, E
    WARMUTH, MK
    JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING, 1986, 3 (04) : 553 - 576
12345