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 条
[31]   HEART: Unrelated parallel machines problem with precedence constraints for task scheduling in cloud computing using heuristic andmeta-heuristicalgorithms [J].
Bhardwaj, Amit Kumar ;
Gajpal, Yuvraj ;
Surti, Chirag ;
Gill, Sukhpal Singh .
SOFTWARE-PRACTICE & EXPERIENCE, 2020, 50 (12) :2231-2251
[32]   Multi processor scheduling algorithm for tasks with precedence relation [J].
Bandyopadhyay, T ;
Basak, S ;
Bhattacharya, S .
TENCON 2004 - 2004 IEEE REGION 10 CONFERENCE, VOLS A-D, PROCEEDINGS: ANALOG AND DIGITAL TECHNIQUES IN ELECTRICAL ENGINEERING, 2004, :B164-B167
[33]   Handling precedence constraints in scheduling problems by the sequence pair representation [J].
Kozik, Andrzej .
JOURNAL OF COMBINATORIAL OPTIMIZATION, 2017, 33 (02) :445-472
[34]   An improved monotone algorithm for scheduling related machines with precedence constraints [J].
van Zuylen, Anke .
OPERATIONS RESEARCH LETTERS, 2011, 39 (06) :423-427
[35]   Flow shop scheduling problems under machine-dependent precedence constraints [J].
Gladky, AA ;
Shafransky, YM ;
Strusevich, VA .
JOURNAL OF COMBINATORIAL OPTIMIZATION, 2004, 8 (01) :13-28
[36]   Handling precedence constraints in scheduling problems by the sequence pair representation [J].
Andrzej Kozik .
Journal of Combinatorial Optimization, 2017, 33 :445-472
[37]   A comparison of scheduling algorithms for multiprocessortasks with precedence constraints [J].
Duemmler, Joerg ;
Kunis, Raphael ;
Ruenger, Gudula .
21ST EUROPEAN CONFERENCE ON MODELLING AND SIMULATION ECMS 2007: SIMULATIONS IN UNITED EUROPE, 2007, :663-+
[38]   Single-machine scheduling with precedence constraints [J].
Correa, JR ;
Schulz, AS .
MATHEMATICS OF OPERATIONS RESEARCH, 2005, 30 (04) :1005-1021
[39]   SCHEDULING PROBLEMS WITH PRECEDENCE CONSTRAINTS: MODELS AND ALGORITHMS [J].
Montemanni, Roberto .
EUROPEAN SIMULATION AND MODELLING CONFERENCE 2012, 2012, :5-12
[40]   Two-machine flow shop scheduling with deteriorating jobs and chain precedence constraints [J].
Zhao, Chuanli ;
Tang, Hengyong .
INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS, 2012, 136 (01) :131-136
12345