CHOOSING THE JOB SEQUENCE AND PROCESSING TIMES TO MINIMIZE TOTAL PROCESSING PLUS FLOW COST ON A SINGLE-MACHINE

被引：148

作者：

VICKSON, RG

机构：

来源：

OPERATIONS RESEARCH | 1980年 / 28卷 / 05期

关键词：

Compendex;

D O I：

10.1287/opre.28.5.1155

中图分类号：

C93 [管理学];

学科分类号：

12 ; 1201 ; 1202 ; 120202 ;

摘要：

SCHEDULING

引用

页码：1155 / 1167

页数：13

共 12 条

[1]

Aho A. V., 1974, DESIGN ANAL COMPUTER

[2]

Conway R, 1967, THEORY SCHEDULING

[3] LOCATION OF BANK ACCOUNTS TO OPTIMIZE FLOAT - ANALYTIC STUDY OF EXACT AND APPROXIMATE ALGORITHMS [J].

CORNUEJOLS, G ;

FISHER, ML ;

NEMHAUSER, GL .

MANAGEMENT SCIENCE, 1977, 23 (08) :789-810

[4] PATHS TREES AND FLOWERS [J].

EDMONDS, J .

CANADIAN JOURNAL OF MATHEMATICS, 1965, 17 (03) :449-&

[5]

KAMEDA T, COMMUNICATION

[6]

Karp R. M., 1972, COMPLEXITY COMPUTER

[7] FUNCTIONAL EQUATION AND ITS APPLICATION TO RESOURCE ALLOCATION AND SEQUENCING PROBLEMS [J].

LAWLER, EL ;

MOORE, JM .

MANAGEMENT SCIENCE SERIES A-THEORY, 1969, 16 (01) :77-84

[8]

Lawler EL., 2001, COMBINATORIAL OPTIMI

[9]

LENSTRA JK, 1977, BW7777 MATH CTR REP

[10] ANALYSIS OF APPROXIMATIONS FOR MAXIMIZING SUBMODULAR SET FUNCTIONS .1. [J].

NEMHAUSER, GL ;

WOLSEY, LA ;

FISHER, ML .

MATHEMATICAL PROGRAMMING, 1978, 14 (03) :265-294

← 1 2 →