Dynamic heuristics for the generalized job-shop scheduling problem

被引：4
作者：
Ghedjati, Fatima [1 ]
Portmann, Marie-Claude [2 ]
机构：
[1] CReSTIC Reims URCA, Moulin Housse,BP 1039, F-51687 Reims 2, France
[2] Ecole Mines, LORIA, F-54042 Nancy, France
来源：
2009 IEEE INTERNATIONAL CONFERENCE ON SYSTEMS, MAN AND CYBERNETICS (SMC 2009), VOLS 1-9 | 2009年
关键词：
scheduling; generalized job-shop; unrelated parallel machines; linear and non-linear process routing; static/dynamic heuristics; ALGORITHMS; OPTIMIZATION; TASKS;
D O I：
10.1109/ICSMC.2009.5346326
中图分类号：
TP3 [计算技术、计算机技术];
学科分类号：
0812 ;
摘要：
This paper proposes to solve the generalized job-shop scheduling problem by using several original static and dynamic heuristics relying on the machines' potential load. We consider a generalized job-shop problem with unrelated parallel machines which can process the operations of the different jobs and, moreover, any precedence constraints between the operations are allowed. The objective is to minimize the completion date of all the jobs (makespan). This problem is NP-hard. Experimental results using various important randomly generated benchmarks are satisfactory and promising.
引用
收藏
页码：2562 / +
页数：2
相关论文
共 50 条
  • [11] A general approach for optimizing regular criteria in the job-shop scheduling problem
    Mati, Yazid
    Dauzere-Peres, Stephane
    Lahlou, Chams
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2011, 212 (01) : 33 - 42
  • [12] An Improved Social Spider Algorithm for the Flexible Job-Shop Scheduling Problem
    Wang, Yao
    Zhu, Linbo
    Wang, Jiwen
    Qiu, Jianfeng
    PROCEEDINGS OF 2015 INTERNATIONAL CONFERENCE ON ESTIMATION, DETECTION AND INFORMATION FUSION ICEDIF 2015, 2015, : 157 - 162
  • [13] An adaptive annealing genetic algorithm for the job-shop planning and scheduling problem
    Liu, Min
    Sun, Zhi-jiang
    Yan, Jun-wei
    Kang, Jing-song
    EXPERT SYSTEMS WITH APPLICATIONS, 2011, 38 (08) : 9248 - 9255
  • [14] A fast estimation of distribution algorithm for dynamic fuzzy flexible job-shop scheduling problem
    Liu, Bojun
    Fan, Yushun
    Liu, Yi
    COMPUTERS & INDUSTRIAL ENGINEERING, 2015, 87 : 193 - 201
  • [15] Dynamic opportunistic maintenance grouping in a lot streaming based job-shop scheduling problem
    Abdollahzadeh-Sangroudi, Hadi
    Moazzam-Jazi, Elham
    Tavakkoli-Moghaddam, Reza
    Ranjbar-Bourani, Mehdi
    COMPUTERS & INDUSTRIAL ENGINEERING, 2023, 183
  • [16] Metaheuristics for the job-shop scheduling problem with machine availability constraints
    Tamssaouet, Karim
    Dauzere-Peres, Stephane
    Yugma, Claude
    COMPUTERS & INDUSTRIAL ENGINEERING, 2018, 125 : 1 - 8
  • [17] Maximizing the service level on the makespan in the stochastic flexible job-shop scheduling problem
    Flores-Gomez, Mario
    Borodin, Valeria
    Dauzere-Peres, Stephane
    COMPUTERS & OPERATIONS RESEARCH, 2023, 157
  • [18] SCHEDULING RULES FOR A SMALL DYNAMIC JOB-SHOP: A SIMULATION APPROACH
    Dileepan, P.
    Ahmadi, M.
    INTERNATIONAL JOURNAL OF SIMULATION MODELLING, 2010, 9 (04) : 173 - 183
  • [19] NEURAL NETWORKS FOR JOB-SHOP SCHEDULING
    WILLEMS, TM
    ROODA, JE
    CONTROL ENGINEERING PRACTICE, 1994, 2 (01) : 31 - 39
  • [20] A deep reinforcement learning model for dynamic job-shop scheduling problem with uncertain processing time
    Wu, Xinquan
    Yan, Xuefeng
    Guan, Donghai
    Wei, Mingqiang
    ENGINEERING APPLICATIONS OF ARTIFICIAL INTELLIGENCE, 2024, 131
12345