SCHEDULING JOBS WITH RELEASE DATES AND TAILS ON IDENTICAL MACHINES TO MINIMIZE THE MAKESPAN

被引：85
|
作者：
CARLIER, J
机构：
[1] Univ Paris VI, Paris, Fr, Univ Paris VI, Paris, Fr
来源：
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH | 1987年 / 29卷 / 03期
关键词：
Compendex;
D O I：
10.1016/0377-2217(87)90243-8
中图分类号：
C93 [管理学];
学科分类号：
12 ; 1201 ; 1202 ; 120202 ;
摘要：
INDUSTRIAL PLANTS - Machinery - JOB ANALYSIS
引用
收藏
页码：298 / 306
页数：9
相关论文
共 50 条
  • [21] SCHEDULING JOBS WITH STOCHASTIC PROCESSING REQUIREMENTS ON PARALLEL MACHINES TO MINIMIZE MAKESPAN OR FLOWTIME
    WEBER, RR
    JOURNAL OF APPLIED PROBABILITY, 1982, 19 (01) : 167 - 182
  • [22] Flow shop scheduling with deteriorating jobs under dominating machines to minimize makespan
    Wang, Ji-Bo
    INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY, 2010, 48 (5-8): : 719 - 723
  • [23] A GPU Parallel Approximation Algorithm for Scheduling Parallel Identical Machines to Minimize Makespan
    Li, Yuanzhe
    Ghalami, Laleh
    Schwiebert, Loren
    Grosu, Daniel
    2018 IEEE INTERNATIONAL PARALLEL AND DISTRIBUTED PROCESSING SYMPOSIUM WORKSHOPS (IPDPSW 2018), 2018, : 619 - 628
  • [24] A further study on two-agent parallel-batch scheduling with release dates and deteriorating jobs to minimize the makespan
    Gao, Yuan
    Yuan, Jinjiang
    Ng, C. T.
    Cheng, T. C. E.
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2019, 273 (01) : 74 - 81
  • [25] Power-aware scheduling of preemptable jobs on identical parallel processors to minimize makespan
    R. Różycki
    J. Węglarz
    Annals of Operations Research, 2014, 213 : 235 - 252
  • [26] The bounded single-machine parallel-batching scheduling problem with family jobs and release dates to minimize makespan
    Nong, Q. Q.
    Ng, C. T.
    Cheng, T. C. E.
    OPERATIONS RESEARCH LETTERS, 2008, 36 (01) : 61 - 66
  • [27] Power-aware scheduling of preemptable jobs on identical parallel processors to minimize makespan
    Rozycki, R.
    Weglarz, J.
    ANNALS OF OPERATIONS RESEARCH, 2014, 213 (01) : 235 - 252
  • [28] Randomized on-line scheduling similar jobs to minimize makespan on two identical processors
    Du D.-L.
    Acta Mathematicae Applicatae Sinica, 2005, 21 (3) : 485 - 488
  • [29] The unbounded parallel batch machine scheduling with release dates and rejection to minimize makespan
    Lu, Lingfa
    Zhang, Liqi
    Yuan, Jinjiang
    THEORETICAL COMPUTER SCIENCE, 2008, 396 (1-3) : 283 - 289
  • [30] Hybrid Flow Shop Scheduling With Learning Effects and Release Dates to Minimize the Makespan
    Wang, Xinyue
    Ren, Tao
    Bai, Danyu
    Chu, Feng
    Lu, Xinyu
    Weng, Zedong
    Li, Jiang
    Liang, Jie
    IEEE TRANSACTIONS ON SYSTEMS MAN CYBERNETICS-SYSTEMS, 2024, 54 (01): : 365 - 378
12345