SCHEDULING 2 JOB CLASSES ON PARALLEL MACHINES

被引:4
|
作者
CHENG, TCE [1 ]
DIAMOND, JE [1 ]
机构
[1] UNIV MANITOBA,DEPT MECH & IND ENGN,WINNIPEG,MB R3T 2N2,CANADA
关键词
D O I
10.1080/07408179508936785
中图分类号
T [工业技术];
学科分类号
08 ;
摘要
The problem of scheduling n jobs on m parallel machines is considered where the jobs are partitioned into two priority classes. The objective is to minimize the total flowtime subject to the constraint that no job in the lower-priority class precedes any job in the higher-priority class that is assigned to the same machine. Conditions for feasibility are derived and used to develop a polynomially bounded dynamic programming algorithm that finds an optimal schedule.
引用
收藏
页码:689 / 693
页数:5
相关论文
共 50 条
  • [31] Scheduling Multiple Orders per Job with Multiple Constraints on Identical Parallel Machines
    王腾
    周炳海
    JournalofDonghuaUniversity(EnglishEdition), 2013, 30 (06) : 466 - 471
  • [32] Scheduling multiple orders per job with multiple constraints on identical parallel machines
    Wang, Teng
    Zhou, Bing-Hai
    Journal of Donghua University (English Edition), 2013, 30 (06) : 466 - 471
  • [33] Unrelated Parallel Machines Scheduling with a Truncated Job-dependent Learning Effect
    Wang, Jia
    Yang, Fan
    Wang, Ji-bo
    INTERNATIONAL CONFERENCE ON COMPUTER SCIENCE AND ARTIFICIAL INTELLIGENCE (ICCSAI 2014), 2015, : 178 - 180
  • [34] Complexity of server scheduling on parallel dedicated machines subject to fixed job sequences
    Cheng, T. C. E.
    Kravchenko, Svetlana A.
    Lin, Bertrand M. T.
    JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 2021, 72 (10) : 2286 - 2289
  • [35] Uniform Parallel Machine Scheduling with Dedicated Machines, Job Splitting and Setup Resources
    Kim, Hyun-Jung
    Lee, Jun-Ho
    2018 IEEE 14TH INTERNATIONAL CONFERENCE ON AUTOMATION SCIENCE AND ENGINEERING (CASE), 2018, : 661 - 663
  • [36] A BICRITERION APPROACH TO PREEMPTIVE SCHEDULING OF PARALLEL MACHINES WITH CONTROLLABLE JOB PROCESSING TIMES
    NOWICKI, E
    ZDRZALKA, S
    DISCRETE APPLIED MATHEMATICS, 1995, 63 (03) : 237 - 256
  • [37] Scheduling with job rejection and nonsimultaneous machine available time on unrelated parallel machines
    Jiang, Dakui
    Tan, Jiayin
    THEORETICAL COMPUTER SCIENCE, 2016, 616 : 94 - 99
  • [38] Online scheduling on unbounded parallel-batch machines with incompatible job families
    Tian, Ji
    Cheng, T. C. E.
    Ng, C. T.
    Yuan, Jinjiang
    THEORETICAL COMPUTER SCIENCE, 2011, 412 (22) : 2380 - 2386
  • [39] Uniform Parallel Machine Scheduling with Dedicated Machines, Job Splitting and Setup Resources
    Lee, Jun-Ho
    Jang, Hoon
    SUSTAINABILITY, 2019, 11 (24)
  • [40] SCHEDULING JOB FAMILIES ON NON-IDENTICAL PARALLEL MACHINES WITH TIME CONSTRAINTS
    Obeid, Ali
    Dauzere-Peres, Stephane
    Yugma, Claude
    PROCEEDINGS OF THE 2011 WINTER SIMULATION CONFERENCE (WSC), 2011, : 1994 - 2005