A NEW INTEGER PROGRAMMING FORMULATION FOR THE PERMUTATION FLOWSHOP PROBLEM

被引：11

作者：

FRIEZE, AM

YADEGAR, J

机构：

[1] UNIV LONDON QUEEN MARY COLL,DEPT COMP SCI & STAT,LONDON E1 4NS,ENGLAND

[2] UNIV LONDON QUEEN MARY COLL,DAP SUPPORT UNIT,LONDON E1 4NS,ENGLAND

来源：

关键词：

D O I：

10.1016/0377-2217(89)90276-2

中图分类号：

C93 [管理学];

学科分类号：

12 ; 1201 ; 1202 ; 120202 ;

摘要：

引用

页码：90 / 98

页数：9

共 28 条

[1]

Baker K., 1974, INTRO SEQUENCING SCH

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

BAKER, KR .

[3]

Bellman R., 1982, MATH ASPECTS SCHEDUL

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

BESTWICK, PF ;

HASTINGS, NAJ .

BROWN, APG ;

LOMNICKI, ZA .

[6]

CAMPBELL HG, 1970, MANAGE SCI B-APPL, V16, pB630

[7]

Conway R, 1967, THEORY SCHEDULING

[8]

Ford L., 1962, FLOWS NETWORKS

[9]

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

[10]

Garey M. R., 1979, COMPUTERS INTRACTIBI