Scheduling identical jobs with chain precedence constraints on two uniform machines

被引：0
|
作者：
Peter Brucker
Johann Hurink
Wieslaw Kubiak
机构：
[1] Universität Osnabrück,
[2] Fachbereich Mathematik/Informatik,undefined
[3] D-49069 Osnabrück,undefined
[4] Germany (e-mail: peter@mathematik.uni-osnabrueck.de),undefined
[5] University of Twente,undefined
[6] Faculty of Mathematical Sciences,undefined
[7] P.O. Box 217,undefined
[8] 7500 AE Enschede,undefined
[9] The Netherlands (e-mail: j.l.hurink@math.utwente.nl),undefined
[10] Memorial University of Newfoundland,undefined
[11] Faculty of Business Administration,undefined
[12] St. John's,undefined
[13] Newfoundland,undefined
[14] Canada (e-mail: wkubiak@morgan.ucs.mun.ca),undefined
来源：
Mathematical Methods of Operations Research | 1999年 / 49卷 / 2期
关键词：
Key words: Scheduling; uniform machines; identical jobs; chain precedence constraints;
D O I：
10.1007/PL00020913
中图分类号：
学科分类号：
摘要：
The problem of scheduling identical jobs with chain precedence constraints on two uniform machines is considered. It is shown that the corresponding makespan problem can be solved in linear time.
引用
收藏
页码：211 / 219
页数：8
相关论文
共 50 条
  • [1] Scheduling identical jobs with chain precedence constraints on two uniform machines
    Brucker, P
    Hurink, J
    Kubiak, W
    [J]. MATHEMATICAL METHODS OF OPERATIONS RESEARCH, 1999, 49 (02) : 211 - 219
  • [2] Scheduling jobs with chain precedence constraints and deteriorating jobs
    Wang, J-B
    Wang, J-J
    Ji, P.
    [J]. JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 2011, 62 (09) : 1765 - 1770
  • [3] Scheduling preemptive jobs with precedence constraints on parallel machines
    Djellab, K
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1999, 117 (02) : 355 - 367
  • [4] Scheduling Jobs with Simple Precedence Constraints on Parallel Machines
    Hoitomt, Debra J.
    Luh, Peter B.
    Max, Eric
    Pattipati, Krishna R.
    [J]. IEEE CONTROL SYSTEMS MAGAZINE, 1990, 10 (02): : 34 - 40
  • [5] A comment on scheduling on uniform machines under chain-type precedence constraints
    Woeginger, GJ
    [J]. OPERATIONS RESEARCH LETTERS, 2000, 26 (03) : 107 - 109
  • [6] A best possible online algorithm for scheduling equal-length jobs on two machines with chain precedence constraints
    Yuan, Junling
    Li, Wenhua
    Yuan, Jinjiang
    [J]. THEORETICAL COMPUTER SCIENCE, 2012, 457 : 174 - 180
  • [7] Flowshop scheduling with identical jobs and uniform parallel machines
    Dessouky, MM
    Dessouky, MI
    Verma, SK
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1998, 109 (03) : 620 - 631
  • [8] APPROXIMATION SCHEMES FOR SCHEDULING JOBS WITH CHAIN PRECEDENCE CONSTRAINTS
    Jansen, Klaus
    Solis-Oba, Roberto
    [J]. INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE, 2010, 21 (01) : 27 - 49
  • [9] Approximation algorithms for scheduling jobs with chain precedence constraints
    Jansen, K
    Solis-Oba, R
    [J]. PARALLEL PROCESSING AND APPLIED MATHEMATICS, 2004, 3019 : 105 - 112
  • [10] Scheduling identical jobs on uniform machines with a conflict graph
    Mallek, Amin
    Bendraouche, Mohamed
    Boudhar, Mourad
    [J]. COMPUTERS & OPERATIONS RESEARCH, 2019, 111 : 357 - 366
12345