AN ADAPTIVE BRANCHING RULE FOR THE PERMUTATION FLOWSHOP PROBLEM

被引：51

作者：

POTTS, CN

机构：

来源：

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH | 1980年 / 5卷 / 01期

关键词：

D O I：

10.1016/0377-2217(80)90069-7

中图分类号：

C93 [管理学];

学科分类号：

12 ; 1201 ; 1202 ; 120202 ;

摘要：

引用

页码：19 / 25

页数：7

共 18 条

[1]

ASHOUR S, 1969, INT J PROD RES, V7, P249

[2] COMPARATIVE STUDY OF FLOW-SHOP ALGORITHMS [J].

BAKER, KR .

OPERATIONS RESEARCH, 1975, 23 (01) :62-73

[3] NEW BOUND FOR MACHINE SCHEDULING [J].

BESTWICK, PF ;

HASTINGS, NAJ .

OPERATIONAL RESEARCH QUARTERLY, 1976, 27 (02) :479-487

[4]

Bricker P., 1977, ANN DISCRETE MATH, V1, P343, DOI [DOI 10.1016/S0167-5060(08)70743-X, 10.1016/S0167-5060(08)70743-X]

[5] SOME APPLICATIONS OF BRANCH-AND-BOUND ALGORITHM TO MACHINE SCHEDULING PROBLEM [J].

BROWN, APG ;

LOMNICKI, ZA .

OPERATIONAL RESEARCH QUARTERLY, 1966, 17 (02) :173-&

[6]

Conway R, 1967, THEORY SCHEDULING

[7]

Garey M. R., 1976, Mathematics of Operations Research, V1, P117, DOI 10.1287/moor.1.2.117

[8] APPLICATION OF BRANCH AND BOUND TECHNIQUE TO SOME FLOW-SHOP SCHEDULING PROBLEMS [J].

IGNALL, E ;

SCHRAGE, L .

OPERATIONS RESEARCH, 1965, 13 (03) :400-&

[9]

Johnson S. M., 1954, NAV RES LOGIST Q, V1, P61, DOI DOI 10.1002/NAV.3800010110

[10] JOB-SHOP SCHEDULING BY IMPLICIT ENUMERATION [J].

LAGEWEG, BJ ;

LENSTRA, JK ;

RINNOOYKAN, AHG .

MANAGEMENT SCIENCE, 1977, 24 (04) :441-450

← 1 2 →