GENERALIZED PAIRWISE INTERCHANGES AND MACHINE SCHEDULING

被引：17

作者：

DELLACROCE, F

机构：

[1] D.A.I., Politecnico di Torino, 10129 Torino

来源：

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH | 1995年 / 83卷 / 02期

关键词：

PAIRWISE INTERCHANGE; BRANCH AND BOUND; DOMINANCE CRITERIA; NEIGHBORHOOD SEARCH;

D O I：

10.1016/0377-2217(95)00009-F

中图分类号：

C93 [管理学];

学科分类号：

12 ; 1201 ; 1202 ; 120202 ;

摘要：

In this paper a generalization of pairwise interchanges is considered and applied to machine scheduling problems. It is shown how these swap operators can be used to compute bounds for Branch and Bound procedures, to prove dominance properties and to define a high-performance neighborhood for local search methods.

引用

页码：310 / 319

页数：10

共 23 条

[1]

Baker K., 1974, INTRO SEQUENCING SCH

[2]

Conway R, 1967, THEORY SCHEDULING

[3]

DELLACROCE F, 1994, DGTC1094 DAI INT REP

[4]

DELLACROCE F, IN PRESS NAVAL RES L