A 2-MACHINE FLOW-SHOP SCHEDULING PROBLEM WITH CONTROLLABLE JOB PROCESSING TIMES

被引：37

作者：

NOWICKI, E

ZDRZALKA, S

机构：

[1] Technical Univ of Wroclaw, Wroclaw, Pol, Technical Univ of Wroclaw, Wroclaw, Pol

来源：

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH | 1988年 / 34卷 / 02期

关键词：

We wish to thank the referees for their helpful suggestions and comments regarding an earlier version of this paper. This research was partially supported by R.P.I.02 'Theory of control and optimization of continuous dynamic systems and discrete processes';

D O I：

10.1016/0377-2217(88)90355-4

中图分类号：

C93 [管理学];

学科分类号：

12 ; 1201 ; 1202 ; 120202 ;

摘要：

引用

页码：208 / 220

页数：13

共 8 条

[1] Conway R, 1967, THEORY SCHEDULING
[2] FISHER ML, 1982, DETERMINISTIC STOCHA
[3] Johnson S. M., 1954, NAV RES LOGIST Q, DOI [10.1002/nav.3800010110, DOI 10.1002/NAV.3800010110]
[4] Karp R.M., 1972, COMPLEXITY COMPUTER
[5] Ullman J.D., 1976, COMPUTER JOB SHOP SC
[6] PRODUCTION PLANNING WITH CONVEX COSTS - A PARAMETRIC STUDY
VEINOTT, AF
[J]. MANAGEMENT SCIENCE, 1964, 10 (03) : 441 - 460
[7] CHOOSING THE JOB SEQUENCE AND PROCESSING TIMES TO MINIMIZE TOTAL PROCESSING PLUS FLOW COST ON A SINGLE-MACHINE
VICKSON, RG
[J]. OPERATIONS RESEARCH, 1980, 28 (05) : 1155 - 1167
[8] 2 SINGLE-MACHINE SEQUENCING PROBLEMS INVOLVING CONTROLLABLE JOB PROCESSING TIMES
VICKSON, RG
[J]. AIIE TRANSACTIONS, 1980, 12 (03): : 258 - 262

← 1 →