DYNAMIC-PROGRAMMING AND DECOMPOSITION APPROACHES FOR THE SINGLE-MACHINE TOTAL TARDINESS PROBLEM

被引：52

作者：

POTTS, CN ^{[1
]}

VANWASSENHOVE, LN ^{[1
]}

机构：

[1] CATHOLIC UNIV LEUVEN,AFDELING IND BELEID,B-3000 LOUVAIN,BELGIUM

来源：

关键词：

D O I：

10.1016/S0377-2217(87)80008-5

中图分类号：

C93 [管理学];

学科分类号：

12 ; 1201 ; 1202 ; 120202 ;

摘要：

引用

页码：405 / 414

页数：10

共 12 条

[1]

ELMAGHRABY SE, 1968, J IND ENGINEERING, V19, P105

EMMONS, H .

[3] DUAL ALGORITHM FOR ONE-MACHINE SCHEDULING PROBLEM [J].

FISHER, ML .

[4] ON DYNAMIC-PROGRAMMING METHODS FOR ASSEMBLY LINE BALANCING [J].

KAO, EPC ;

QUEYRANNE, M .

[5]

Lawler E. L., 1982, Operations Research Letters, V1, P207, DOI 10.1016/0167-6377(82)90022-0

[6]

Lawler E. L., 1977, ANN DISCRETE MATH, V1, P331, DOI [10.1016/S0167-5060(08)70742-8, DOI 10.1016/S0167-5060(08)70742-8]

[7]

LAWLER EL, 1979, BW106 MATH CENTR REP

[8]

PICARD JC, 1978, OPER RES, V26, P88

[9]

POTS CN, 1982, OPERATIONS RES LETT, V1, P177

[10] MINIMIZING TOTAL COSTS IN ONE-MACHINE SCHEDULING [J].

RINNOOYKAN, AHG ;

LAGEWEG, BJ ;

LENSTRA, JK .