Tabu search for a class of single-machine scheduling problems

被引：37

作者：

Al-Turki, U ^{[1
]}

Fedjki, C ^{[1
]}

Andijani, A ^{[1
]}

机构：

[1] King Fahd Univ Petr & Minerals, Dept Syst Engn, Dhahran 31261, Saudi Arabia

来源：

COMPUTERS & OPERATIONS RESEARCH | 2001年 / 28卷 / 12期

关键词：

tabu search; scheduling; variance minimization; V-shaped schedules;

D O I：

10.1016/S0305-0548(00)00036-8

中图分类号：

TP39 [计算机的应用];

学科分类号：

081203 ; 0835 ;

摘要：

In this paper we develop a tabu search-based solution procedure designed specifically for a certain class of single-machine scheduling problems with a non-regular performance measure. The performance of the developed algorithm is tested for solving the variance minimization problem. Problems from the literature are used to test the performance of the algorithm. This algorithm can be used for solving other problems such as minimizing completion time deviation from a common due date.

引用

页码：1223 / 1230

页数：8

共 20 条

[1] A dominant subset of V-shaped sequences for a class of single machine sequencing problems [J].

AlTurki, UM ;

Mittenthal, J ;

Raghavachari, M .

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1996, 88 (02) :345-347

[2]

ALTURKI UM, 1999, 5 SAUDI ENG C UMM AL, V4, P207

[3]

[Anonymous], 1986, C NUM METH COMB OPT

[4] SEQUENCING WITH EARLINESS AND TARDINESS PENALTIES - A REVIEW [J].

BAKER, KR ;

SCUDDER, GD .

OPERATIONS RESEARCH, 1990, 38 (01) :22-36

[5] TABU SEARCH AND DESIGN OPTIMIZATION [J].

BLAND, JA ;

DAWSON, GP .

COMPUTER-AIDED DESIGN, 1991, 23 (03) :195-201

[6]

ELION S, 1977, MANAGE SCI, V23, P567

[7] FUTURE PATHS FOR INTEGER PROGRAMMING AND LINKS TO ARTIFICIAL-INTELLIGENCE [J].

GLOVER, F .

COMPUTERS & OPERATIONS RESEARCH, 1986, 13 (05) :533-549

[8]

Glover F., 1989, ORSA Journal on Computing, V1, P190, DOI [10.1287/ijoc.2.1.4, 10.1287/ijoc.1.3.190]

[9]

GUPTA MC, 1990, J OPER RES SOC, V41, P767

[10]

HANSEN P, 1987, 4387 RUTCOR

← 1 2 →