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

共 30 条

[1]

[Anonymous], MISTA PAR 28 31 AUG

[2]

[Anonymous], ELSEVIER CO IN PRESS

[3]

[Anonymous], 1987, SIMULATED ANNEALING

[4]

[Anonymous], 37 INT C COMP IND EN

[5]

[Anonymous], 1982, P PART NATO ADV STUD

[6]

[Anonymous], RAIRO OPERATIONAL RE

[7]

Baker K. R., 1974, Introduction to Sequencing and Scheduling"

[8]

Blazewicz J., 1994, Scheduling in Computer and Manufacturing Systems, VSecond

[9]

Blum C., 2004, J MATH MODELLING ALG, V3, P285, DOI DOI 10.1023/B:JMMA.0000038614.39977.6F

[10]

CAMPBELL HG, 1970, MANAGE SCI B-APPL, V16, pB630

← 1 2 3 →