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
关键词
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 条
  • [1] Preemptive jobs scheduling on parallel machines with setup times and renewable resources
    sliwinski, Tomasz
    Toczylowski, Eugeniusz
    LEAN BUSINESS SYSTEMS AND BEYOND, 2008, 257 : 29 - 39
  • [2] Scheduling jobs on parallel machines with setup times and ready times
    Pfund, Michele
    Fowler, John W.
    Gadkari, Amit
    Chen, Yan
    COMPUTERS & INDUSTRIAL ENGINEERING, 2008, 54 (04) : 764 - 782
  • [3] Scheduling jobs on parallel machines with sequence-dependent setup times
    Lee, YH
    Pinedo, M
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1997, 100 (03) : 464 - 474
  • [4] Scheduling jobs on dynamic parallel machines with sequence-dependent setup times
    Zne-Jung Lee
    Shih-Wei Lin
    Kuo-Ching Ying
    The International Journal of Advanced Manufacturing Technology, 2010, 47 : 773 - 781
  • [5] Online scheduling of malleable parallel jobs with setup times on two identical machines
    Guo, Shouwei
    Kang, Liying
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2010, 206 (03) : 555 - 561
  • [6] Scheduling jobs on dynamic parallel machines with sequence-dependent setup times
    Lee, Zne-Jung
    Lin, Shih-Wei
    Ying, Kuo-Ching
    INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY, 2010, 47 (5-8): : 773 - 781
  • [7] Scheduling preemptive jobs with precedence constraints on parallel machines
    Djellab, K
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1999, 117 (02) : 355 - 367
  • [8] Preemptive Scheduling of Jobs with a Learning Effect on Two Parallel Machines
    Zurowski, Marcin
    OPERATIONS RESEARCH PROCEEDINGS 2017, 2018, : 587 - 592
  • [9] The integration of shared renewable resources considering setup times for the parallel machine scheduling problem
    Shafiee, Mohammad
    Amiri-Aref, Mehdi
    Klibi, Walid
    COMPUTERS & INDUSTRIAL ENGINEERING, 2025, 200
  • [10] Scheduling High Multiplicity Jobs on Parallel Multi-Purpose Machines with Setup Times and Machine Available Times
    Jing, Caixia
    Huang, Wanzhen
    Zhang, Lei
    Zhang, Heng
    ASIA-PACIFIC JOURNAL OF OPERATIONAL RESEARCH, 2022, 39 (06)