A genetic algorithm to minimize the total of tardiness multiprocessing tasks on two dedicated processors

被引：0

作者：

Kacem, Adel ^{[1
]}

Dammak, Abdelaziz ^{[1
]}

机构：

[1] Fac Econ & Management, Lab MODILS, Sfax, Tunisia

来源：

2017 4TH INTERNATIONAL CONFERENCE ON CONTROL, DECISION AND INFORMATION TECHNOLOGIES (CODIT) | 2017年

关键词：

scheduling; total of tardiness; tasks; dedicated processors; genetic algorithms; lower bound;

D O I：

暂无

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

in this work, we study the problem of scheduling multiprocessor tasks on two dedicated processors with release date. Our objective is to minimize the sum of the tasks tardiness. This NP-hard problem in the strong sense requires the use of well-adapted methods. Thus, to solve this problem, a genetic algorithm was designed and a lower bound was constructed to evaluate the experimental results.

引用

页码：85 / 90

页数：6

共 30 条

[1]

Ackley D., 1987, THESIS

[2]

Amoura A. K., 1997, Algorithms - ESA '97. 5th Annual European Symposium. Proceedings, P1

[3]

[Anonymous], 1989, The Technical Writer's Handbook

[4]

Artiba A., 1990, THESIS

[5]

Belkacem K., 2006, THESIS

[6] DYNAMIC PROGRAMMING [J].

BELLMAN, R .

SCIENCE, 1966, 153 (3731) :34-&

[7] A genetic algorithm for the multiple-choice integer program [J].

BenHadjAlouane, A ;

Bean, JC .

OPERATIONS RESEARCH, 1997, 45 (01) :92-101

[8] Preemptive multiprocessor task scheduling with release times and time windows [J].

Bianco, L ;

Blazewicz, J ;

DellOlmo, P ;

Drozdowski, M .

ANNALS OF OPERATIONS RESEARCH, 1997, 70 (0) :43-55

[9] Scheduling multiprocessor tasks on two parallel processors [J].

Blazewicz, J ;

Dell'Olmo, P ;

Drozdowski, M .

RAIRO-OPERATIONS RESEARCH, 2002, 36 (01) :37-51

[10]

CARLIER J, 1993, RAIRO-RECH OPER, V27, P77

← 1 2 3 →