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 条
  • [1] Heuristics and a hybrid meta-heuristic for a generalized job-shop scheduling problem
    Ghedjati, Fatima
    2010 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION (CEC), 2010,
  • [2] ON THE JOB-SHOP SCHEDULING PROBLEM
    MANNE, AS
    OPERATIONS RESEARCH, 1960, 8 (02) : 219 - 223
  • [3] Decomposition heuristics for robust job-shop scheduling
    Byeon, ES
    Wu, SD
    Storer, RH
    IEEE TRANSACTIONS ON ROBOTICS AND AUTOMATION, 1998, 14 (02): : 303 - 313
  • [4] Selection of Heuristics for the Job-Shop Scheduling Problem Based on the Prediction of Gaps in Machines
    Abreu, Pedro
    Soares, Carlos
    Valente, Jorge M. S.
    LEARNING AND INTELLIGENT OPTIMIZATION, 2009, 5851 : 134 - 147
  • [5] JOB-SHOP SCHEDULING HEURISTICS WITH LOCAL NEIGHBORHOOD SEARCH
    SPACHIS, AS
    KING, JR
    INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 1979, 17 (06) : 507 - 526
  • [6] Solving the job-shop scheduling problem optimally by dynamic programming
    Gromicho, Joaquim A. S.
    van Hoorn, Jelke J.
    Saldanha-da-Gama, Francisco
    Timmer, Gerrit T.
    COMPUTERS & OPERATIONS RESEARCH, 2012, 39 (12) : 2968 - 2977
  • [7] Exploring Problem State Transformations to Enhance Hyper-heuristics for the Job-Shop Scheduling Problem
    Garza-Santisteban, Fernando
    Amaya, Ivan
    Cruz-Duarte, Jorge
    Carlos Ortiz-Bayliss, Jose
    Ozcan, Ender
    Terashima-Marin, Hugo
    2020 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION (CEC), 2020,
  • [8] Exploring Reward-based Hyper-heuristics for the Job-shop Scheduling Problem
    Lara-Cardenas, Erick
    Silva-Galvez, Arturo
    Ortiz-Bayliss, Jose Carlos
    Amaya, Ivan
    Cruz-Duarte, Jorge M.
    Terashima-Marin, Hugo
    2020 IEEE SYMPOSIUM SERIES ON COMPUTATIONAL INTELLIGENCE (SSCI), 2020, : 3133 - 3140
  • [9] JOB-SHOP SCHEDULING HEURISTICS FOR SEQUENCE-DEPENDENT SETUPS
    LOW, CY
    COMPUTERS & INDUSTRIAL ENGINEERING, 1995, 29 : 279 - 283
  • [10] A COMPREHENSIVE ANALYSIS OF GROUP SCHEDULING HEURISTICS IN A JOB-SHOP CELL
    RUBEN, RA
    MOSIER, CT
    MAHMOODI, F
    INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 1993, 31 (06) : 1343 - 1369
12345