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 条
  • [21] Makespan minimization for scheduling unrelated parallel machines with setup times
    Ying, Kuo-Ching
    Lee, Zne-Jung
    Lin, Shih-Wei
    JOURNAL OF INTELLIGENT MANUFACTURING, 2012, 23 (05) : 1795 - 1803
  • [22] Makespan minimization for scheduling unrelated parallel machines with setup times
    Kuo-Ching Ying
    Zne-Jung Lee
    Shih-Wei Lin
    Journal of Intelligent Manufacturing, 2012, 23 : 1795 - 1803
  • [23] A note on scheduling identical parallel machines with preemptions and setup times
    Boudhar, Mourad
    Dolgui, Alexandre
    Haned, Amina
    Kerdali, Abida
    Kovalev, Sergey
    Kovalyov, Mikhail Y.
    INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 2025, 63 (03) : 1203 - 1208
  • [24] Preemptive scheduling of independent jobs on identical parallel machines subject to migration delays
    Fishkin, AV
    Jansen, K
    Sevastyanov, SV
    Sitters, R
    ALGORITHMS - ESA 2005, 2005, 3669 : 580 - 591
  • [25] Preemptive scheduling of independent jobs on identical parallel machines subject to migration delays
    S. V. Sevastyanov
    R. A. Sitters
    A. V. Fishkin
    Automation and Remote Control, 2010, 71 : 2093 - 2101
  • [26] Preemptive Scheduling of Independent Jobs on Identical Parallel Machines Subject to Migration Delays
    Sevastyanov, S. V.
    Sitters, R. A.
    Fishkin, A. V.
    AUTOMATION AND REMOTE CONTROL, 2010, 71 (10) : 2093 - 2101
  • [27] ON ALMOST OPTIMAL PRIORITY RULES FOR PREEMPTIVE SCHEDULING OF STOCHASTIC JOBS ON PARALLEL MACHINES
    WEISS, G
    ADVANCES IN APPLIED PROBABILITY, 1995, 27 (03) : 821 - 839
  • [28] Preemptive scheduling on uniform parallel machines with controllable job processing times
    Shakhlevich, Natalia V.
    Strusevich, Vitaly A.
    ALGORITHMICA, 2008, 51 (04) : 451 - 473
  • [29] Preemptive Scheduling on Uniform Parallel Machines with Controllable Job Processing Times
    Natalia V. Shakhlevich
    Vitaly A. Strusevich
    Algorithmica, 2008, 51 : 451 - 473
  • [30] Scheduling families of jobs with setup times
    Liaee, MM
    Emmons, H
    INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS, 1997, 51 (03) : 165 - 176
12345