A tabu search algorithm for job shop scheduling

被引：53

作者：

Ponnambalam, SG ^{[1
]}

Aravindan, P

Rajesh, SV

机构：

[1] Reg Engn Coll, Dept Prod Engn, Tiruchirappalli 620015, Tamil Nadu, India

[2] Tata Consultancy Serv, Chennai, India

来源：

INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY | 2000年 / 16卷 / 10期

关键词：

heuristics; job shop scheduling; tabu search;

D O I：

10.1007/s001700070030

中图分类号：

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

学科分类号：

0812 ;

摘要：

In this paper the tabu search technique is considered for solving job shop scheduling problems. The performance measure considered is makespan time. The adjacent pairwise interchange method is used to generate neighbourhoods. The results of tabu search are compared with simulated annealing and genetic algorithms. It is concluded that the performance of tabu search is comparable to that of genetic algorithm and simulated annealing. The future research directions are also discussed.

引用

页码：765 / 771

页数：7

共 16 条

[1] A composite heuristic for the single machine early/tardy job scheduling problem [J].

Almeida, MT ;

Centeno, M .

COMPUTERS & OPERATIONS RESEARCH, 1998, 25 (7-8) :625-635

[2]

Baker KR., 1974, Introduction to Sequencing and Scheduling

[3] SOLVING THE JOB-SHOP SCHEDULING PROBLEM WITH TABU SEARCH [J].

BARNES, JW ;

CHAMBERS, JB .

IIE TRANSACTIONS, 1995, 27 (02) :257-263

[4] Improving job-shop schedules through critical pairwise exchanges [J].

Chu, C ;

Proth, JM ;

Wang, C .

INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 1998, 36 (03) :683-694

[5]

Gen M, 1997, GENETIC ALGORITHM EN

[6] Using tabu search to solve the common due date early/tardy machine scheduling problem [J].

James, RJW .

COMPUTERS & OPERATIONS RESEARCH, 1997, 24 (03) :199-208

[7] A genetic algorithm for scheduling flexible manufacturing systems [J].

Jawahar, N ;

Aravindan, P ;

Ponnambalam, SG .

INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY, 1998, 14 (08) :588-607

[8]

KHATOR SK, 1998, TABU SEARCH BASED SC, P1

[9]

LOURENCO HR, 1995, EUR J OPER RES, V83, P347, DOI 10.1016/0377-2217(95)00012-F

[10] A comparison of neighborhood search techniques for multi-objective combinatorial problems [J].

Marett, R ;

Wright, M .

COMPUTERS & OPERATIONS RESEARCH, 1996, 23 (05) :465-483

← 1 2 →