Preemptive jobs scheduling on parallel machines with setup times and renewable resources

被引：0
|
作者：
Śliwiński, Tomasz [1 ]
Toczylowski, Eugeniusz [1 ]
机构：
[1] Warsaw University of Technology, Institute of Control and Computation Engineering, Warsaw,00-665, Poland
来源：
IFIP Advances in Information and Communication Technology | 2008年 / 257卷
关键词：
Linear programming - Scheduling - Scheduling algorithms;
D O I：
暂无
中图分类号：
C93 [管理学];
学科分类号：
12 ; 1201 ; 1202 ; 120202 ;
摘要：
A two-stage algorithm for scheduling preemptive jobs on parallel machines with minimum makespan criterion and requirements for limited renewable resources and existence of sequence dependent setup times is investigated. In the first stage of the algorithm a set of best elementary feasible plans is obtained through column generation. For the second stage we compare genetic algorithms for sequencing elementary plans, where various approximate criterions for calculation minimum makespan are used. © 2008, IFIP International Federation for Information Processing. All rights reserved.
引用
收藏
页码：29 / 39
相关论文
共 50 条
  • [31] Variable neighborhood search approaches for scheduling jobs on parallel machines with sequence-dependent setup times, precedence constraints, and ready times
    Driessel, Rene
    Moench, Lars
    COMPUTERS & INDUSTRIAL ENGINEERING, 2011, 61 (02) : 336 - 345
  • [32] Scheduling Jobs on Parallel Machines with Sequence-Dependent Setup Times, Precedence Constraints, and Ready Times Using Variable Neighborhood Search
    Driessel, Rene
    Moench, Lars
    CIE: 2009 INTERNATIONAL CONFERENCE ON COMPUTERS AND INDUSTRIAL ENGINEERING, VOLS 1-3, 2009, : 273 - 278
  • [33] Scheduling Jobs with Variable Job Processing Times on Unrelated Parallel Machines
    Zhang, Guang-Qian
    Wang, Jian-Jun
    Liu, Ya-Jing
    SCIENTIFIC WORLD JOURNAL, 2014,
  • [34] Scheduling identical jobs on uniform parallel machines with random processing times
    Dessouky, MI
    Marcellus, RL
    Zhang, L
    COMPUTERS & INDUSTRIAL ENGINEERING, 1998, 35 (1-2) : 109 - 112
  • [35] Scheduling identical jobs on uniform parallel machines with random processing times
    Dessouky, Mohamed I.
    Marcellus, Richard L.
    Zhang, Li
    Computers and Industrial Engineering, 1998, 35 (1-2): : 109 - 112
  • [36] Scheduling jobs with sizes and delivery times on identical parallel batch machines
    Li, Yijie
    Li, Shuguang
    THEORETICAL COMPUTER SCIENCE, 2020, 841 : 1 - 9
  • [37] Integer preemptive scheduling on parallel machines
    Baptiste, Ph
    Carlier, J.
    Kononov, A.
    Queyranne, M.
    Sevastyanov, S.
    Sviridenko, M.
    OPERATIONS RESEARCH LETTERS, 2012, 40 (06) : 440 - 444
  • [38] PREEMPTIVE SCHEDULING OF HYBRID PARALLEL MACHINES
    BALAKRISHNAN, A
    OPERATIONS RESEARCH, 1989, 37 (02) : 301 - 313
  • [39] Preemptive scheduling of equal length jobs with release dates on two uniform parallel machines
    Lushchakova, Irina N.
    DISCRETE OPTIMIZATION, 2009, 6 (04) : 446 - 460
  • [40] Unrelated parallel machines scheduling with dependent setup times in textile industry
    Berthier, A.
    Yalaoui, A.
    Chehade, H.
    Yalaoui, F.
    Amodeo, L.
    Bouillot, C.
    COMPUTERS & INDUSTRIAL ENGINEERING, 2022, 174
12345