SCHEDULING JOBS WITH RELEASE DATES AND TAILS ON IDENTICAL MACHINES TO MINIMIZE THE MAKESPAN

被引：85

作者：

CARLIER, J

机构：

[1] Univ Paris VI, Paris, Fr, Univ Paris VI, Paris, Fr

来源：

关键词：

Compendex;

D O I：

10.1016/0377-2217(87)90243-8

中图分类号：

C93 [管理学];

学科分类号：

12 ; 1201 ; 1202 ; 120202 ;

摘要：

INDUSTRIAL PLANTS - Machinery - JOB ANALYSIS

引用

页码：298 / 306

页数：9

共 21 条

[1] SEQUENCING WITH DUE-DATES AND EARLY START TIMES TO MINIMIZE MAXIMUM TARDINESS
BAKER, KR
SU, ZS
[J]. NAVAL RESEARCH LOGISTICS, 1974, 21 (01) : 171 - 176
[2] BLAZEWICZ J, 1979, INFORMATION PROCESSI, V2, P60
[3] BRATLEY P, 1971, NAVAL RES LOGISTICS, V20, P57
[4] THE ONE-MACHINE SEQUENCING PROBLEM
CARLIER, J
[J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1982, 11 (01) : 42 - 47
[5] CARLIER J, 1978, RAIRO-RECH OPER, V12, P333
[6] Carlier J., 1984, THESIS, P6
[7] Coffman E.G., 1976, COMPUTER JOB SHOP SC
[8] Garey Michael R., 1979, COMPUTERS INTRACTABI
[9] ON FLOWSHOP SCHEDULING WITH RELEASE AND DUE DATES TO MINIMIZE MAXIMUM LATENESS
GRABOWSKI, J
SKUBALSKA, E
SMUTNICKI, C
[J]. JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 1983, 34 (07) : 615 - 620
[10] GRABOWSKI J, 1980, OPSEARCH, V17