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 条

[31] A multi-modal immune algorithm for the job-shop scheduling problem
Luh, Guan-Chun
Chueh, Chung-Huei
INFORMATION SCIENCES, 2009, 179 (10) : 1516 - 1532
[32] Improvement of Ant Colony Algorithm Performance for the Job-Shop Scheduling Problem Using Evolutionary Adaptation and Software Realization Heuristics
Matrenin, Pavel V.
ALGORITHMS, 2023, 16 (01)
[33] A Genetic Programming Framework for Heuristic Generation for the Job-Shop Scheduling Problem
Lara-Cardenas, E.
Sanchez-Diaz, X.
Amaya, I
Cruz-Duarte, J. M.
Ortiz-Bayliss, J. C.
ADVANCES IN SOFT COMPUTING, MICAI 2020, PT I, 2020, 12468 : 284 - 295
[34] A SOLUTION TO SINGLE-MACHINE INVERSE JOB-SHOP SCHEDULING PROBLEM
Wang, Y.
Yang, O.
Wang, S. N.
INTERNATIONAL JOURNAL OF SIMULATION MODELLING, 2019, 18 (02) : 335 - 343
[35] Two decompositions for the bicriteria job-shop scheduling problem with discretely controllable processing times
Niu, Ganggang
Sun, Shudong
Lafon, Pascal
Zhang, Yingfeng
Wang, Junqiang
INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 2012, 50 (24) : 7415 - 7427
[36] Optimization of transport constraints and quality of service for joint resolution of uncertain scheduling and the job-shop problem with routing (JS']JSSPR) as opposed to the job-shop problem with transport (JS']JSSPT)
Assafr, Khadija
Alaya, Bechir
Zidi, Salah
Zrigui, Mounir
JOURNAL OF PROJECT MANAGEMENT, 2024, 9 (02) : 109 - 130
[37] An Improved Genetic Algorithm for the Distributed and Flexible Job-shop Scheduling problem
De Giovanni, L.
Pezzella, F.
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2010, 200 (02) : 395 - 408
[38] SCALING PROPERTIES OF NEURAL NETWORKS FOR JOB-SHOP SCHEDULING
FOO, SY
TAKEFUJI, Y
SZU, H
NEUROCOMPUTING, 1995, 8 (01) : 79 - 91
[39] Benchmarking flexible job-shop scheduling and control systems
Trentesaux, Damien
Pach, Cyrille
Bekrar, Abdelghani
Sallez, Yves
Berger, Thierry
Bonte, Therese
Leitao, Paulo
Barbosa, Jose
CONTROL ENGINEERING PRACTICE, 2013, 21 (09) : 1204 - 1225
[40] An effective heuristic for flexible job-shop scheduling problem with maintenance activities
Wang, Shijin
Yu, Jianbo
COMPUTERS & INDUSTRIAL ENGINEERING, 2010, 59 (03) : 436 - 447

← 1 2 3 4 5 →