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 条
  • [21] Job-shop scheduling with processing alternatives
    Kis, T
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2003, 151 (02) : 307 - 332
  • [22] Job-shop scheduling with limited buffers
    Liljenvall, T
    ALGORITHMS AND ARCHITECTURES FOR REAL-TIME CONTROL 1997, 1997, : 301 - 302
  • [23] FUZZY CONSTRAINTS IN JOB-SHOP SCHEDULING
    DUBOIS, D
    FARGIER, H
    PRADE, H
    JOURNAL OF INTELLIGENT MANUFACTURING, 1995, 6 (04) : 215 - 234
  • [24] A hybrid heuristic to solve the parallel machines job-shop scheduling problem
    Rossi, Andrea
    Boschi, Elena
    ADVANCES IN ENGINEERING SOFTWARE, 2009, 40 (02) : 118 - 127
  • [25] Skipping Strategy (SS) for Initial Population of Job-Shop Scheduling Problem
    Abdolrazzagh-Nezhad, M.
    Nababan, E. B.
    Sarim, H. M.
    2ND INTERNATIONAL CONFERENCE ON COMPUTING AND APPLIED INFORMATICS 2017, 2018, 978
  • [26] A new hybrid parallel genetic algorithm for the job-shop scheduling problem
    Spanos, Athanasios C.
    Ponis, Stavros T.
    Tatsiopoulos, Ilias P.
    Christou, Ioannis T.
    Rokou, Elena
    INTERNATIONAL TRANSACTIONS IN OPERATIONAL RESEARCH, 2014, 21 (03) : 479 - 499
  • [27] Scatter search algorithm for the multiprocessor task job-shop scheduling problem
    Fan, Kun
    Wang, Meng
    Zhai, Yafei
    Li, Xinning
    COMPUTERS & INDUSTRIAL ENGINEERING, 2019, 127 : 677 - 686
  • [28] General particle swarm optimization algorithm for job-shop scheduling problem
    Sch. of Mechanical Sci. and Eng., Huazhong Univ. of S and T, Wuhan 430074, China
    Jisuanji Jicheng Zhizao Xitong, 2006, 6 (911-917+923):
  • [29] A SCHEDULING PROBLEM IN A SEMIOPEN JOB-SHOP - THE CASE OF A CORDSET MANUFACTURING COMPANY
    ALFA, AS
    DOLHUN, KL
    LI, CL
    MATHEMATICAL AND COMPUTER MODELLING, 1994, 20 (02) : 1 - 8
  • [30] A variable neighbourhood search algorithm for the flexible job-shop scheduling problem
    Amiri, M.
    Zandieh, M.
    Yazdani, M.
    Bagheri, A.
    INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 2010, 48 (19) : 5671 - 5689
12345