Categorized Assignment Scheduling: a Tabu Search Approach
作者:
PunnenAbraham P.,
AnejaY. P.,
期刊:
Journal of the Operational Research Society
(Taylor Available online 1993)
卷期:
Volume 44,
issue 7
页码: 673-679
ISSN:0160-5682
年代: 1993
DOI:10.1057/jors.1993.116
出版商: Taylor&Francis
关键词: Assignment;Scheduling;Heuristics;Tabu Search;Greedy Algorithm
数据来源: Taylor
摘要:
AbstractThe assignment problem (AP) and bottleneck assignment problem (BAP) are well studied in operational research literature. In this paper we consider two related problems which simultaneously generalize both AP and BAP. Unlike AP and BAP, these generalizations are strongly NP-complete. We propose two heuristics to solve these generalized problems: one based on a greedy principle and the other based on tabu search. Computational results are presented which show that these heuristics, when used together, produce good quality solutions. Our adaptation of tabu search also gives some new insight into the application of tabu search on permutation problems.
点击下载:
PDF (3371KB)
返 回