A LAGRANGEAN RELAXATION ALGORITHM FOR THE 2 DUTY PERIOD SCHEDULING PROBLEM

被引：35

作者：

SHEPARDSON, F ^{[1
]}

MARSTEN, RE ^{[1
]}

机构：

[1] UNIV ARIZONA,TUCSON,AZ 85721

来源：

关键词：

D O I：

10.1287/mnsc.26.3.274

中图分类号：

C93 [管理学];

学科分类号：

12 ; 1201 ; 1202 ; 120202 ;

摘要：

引用

页码：274 / 281

页数：8

共 27 条

[21] SET PARTITIONING AND CHAIN DECOMPOSITION [J].

NEMHAUSER, GL ;

TROTTER, LE ;

NAUSS, RM .

MANAGEMENT SCIENCE SERIES A-THEORY, 1974, 20 (11) :1413-1423

[22]

NEMHAUSER GL, 1978, 399 CORN U COLL ENG

[23]

ORLIN J, 1977, 771 STANF U DEP OP R

[24]

POLJAK BT, 1967, SOV MATH DOKL, V8, P593

[25] OPERATOR-SCHEDULING PROBLEM - NETWORK-FLOW APPROACH [J].

SEGAL, M .

[26] OPTIMAL SCHEDULING OF 2 CONSECUTIVE IDLE PERIODS [J].

TIBREWALA, R ;

PHILLIPP.D ;

BROWNE, J .

MANAGEMENT SCIENCE SERIES A-THEORY, 1972, 19 (01) :71-75

[27] OPTIMAL CAPACITY SCHEDULING .1. [J].

VEINOTT, AF ;

WAGNER, HM .