A DUAL-COST HEURISTIC FOR THE CAPACITATED LOT SIZING PROBLEM

被引：17

作者：

TRIGEIRO, WW

机构：

来源：

关键词：

D O I：

10.1080/07408178708975371

中图分类号：

T [工业技术];

学科分类号：

08 ;

摘要：

引用

页码：67 / 72

页数：6

共 14 条

[1]

BILLINGTON PJ, 1983, THESIS CORNELL U

[2]

Camerini P.M., 1975, MATH PROGRAMMING STU, P26, DOI DOI 10.1007/BFB0120697

[3]

Dixon P, 1981, J OPERATIONS MANAGEM, V2, P23

DOGRAMACI, A ;

PANAYIOTOPOULOS, JC ;

ADAM, NR .

AIIE TRANSACTIONS, 1981, 13 (04) :294-303

[5]

Eisenhut P. S., 1975, AIIE Transactions, V7, P170, DOI 10.1080/05695557508974999

[6]

Held M., 1974, Mathematical Programming, V6, P62, DOI 10.1007/BF01580223

[7] LOWER BOUNDING STRUCTURE FOR LOT-SIZE SCHEDULING PROBLEMS [J].

KLEINDORFER, PR ;

NEWSON, EFP .

[8]

LAMBRECHT MR, 1979, AIIE T, V11, P319, DOI 10.1080/05695557908974478

[9]

Shor N., 1968, CYBERNETICS, V4, P79, DOI DOI 10.1007/BF01073933

[10]

SILVER EA, 1973, PRODUCTION INVENTORY, V14, P64