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 条

[11] TABU SEARCH FOR LARGE-SCALE TIMETABLING PROBLEMS [J].

HERTZ, A .

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1991, 54 (01) :39-47

[12] TABU SEARCH FOR THE MULTILEVEL GENERALIZED ASSIGNMENT PROBLEM [J].

LAGUNA, M ;

KELLY, JP ;

GONZALEZVELARDE, JL ;

GLOVER, F .

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1995, 82 (01) :176-189

[13] STOCHASTIC SINGLE-MACHINE SCHEDULING WITH QUADRATIC EARLY-TARDY PENALTIES [J].

MITTENTHAL, J ;

RAGHAVACHARI, M .

OPERATIONS RESEARCH, 1993, 41 (04) :786-796

[14] A HYBRID SIMULATED ANNEALING APPROACH FOR SINGLE-MACHINE SCHEDULING PROBLEMS WITH NONREGULAR PENALTY-FUNCTIONS [J].

MITTENTHAL, J ;

RAGHAVACHARI, M ;

RANA, AI .

COMPUTERS & OPERATIONS RESEARCH, 1993, 20 (02) :103-111

[15]

NOWICKI E, 1996, 894 ICT PRE TU WROCL

[16]

Raghavachari M., 1988, Opsearch, V25, P144

[17] MINIMIZING TIME-IN-SYSTEM VARIANCE FOR A FINITE JOBSET [J].

SCHRAGE, L .

MANAGEMENT SCIENCE SERIES A-THEORY, 1975, 21 (05) :540-543

[18] ON TABU SEARCH FOR THE LOCATION OF INTERACTING HUB FACILITIES [J].

SKORINKAPOV, D ;

SKORINKAPOV, J .

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1994, 73 (03) :502-509

[19] SOME EFFICIENT HEURISTIC METHODS FOR THE FLOW-SHOP SEQUENCING PROBLEM [J].

TAILLARD, E .

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1990, 47 (01) :65-74

[20] DETERMINISTIC AND RANDOM SINGLE-MACHINE SEQUENCING WITH VARIANCE MINIMIZATION [J].

VANI, V ;

RAGHAVACHARI, M .

OPERATIONS RESEARCH, 1987, 35 (01) :111-120

← 1 2 →