THE FIXED JOB SCHEDULE PROBLEM WITH SPREAD-TIME CONSTRAINTS

被引：61

作者：

FISCHETTI, M

MARTELLO, S

TOTH, P

机构：

[1] Univ of Bologna, Bologna, Italy, Univ of Bologna, Bologna, Italy

来源：

关键词：

D O I：

10.1287/opre.35.6.849

中图分类号：

C93 [管理学];

学科分类号：

12 ; 1201 ; 1202 ; 120202 ;

摘要：

引用

页码：849 / 858

页数：10

共 8 条

[1] COMPLEXITY OF COMPUTING MEASURE OF U[AI, BI] [J].

FREDMAN, ML ;

WEIDE, B .

[2]

Garey Michael R., 1979, COMPUTERS INTRACTABI

[3]

GAREY MR, 1979, COMPLEXITY COLORING

[4] MINIMAL RESOURCES FOR FIXED AND VARIABLE JOB SCHEDULES [J].

GERTSBAKH, I ;

STERN, HI .

[5]

GUPTA UI, 1979, IEEE T COMPUT, V28, P807, DOI 10.1109/TC.1979.1675260

[6]

LENSTRA JK, 1985, COMMUNICATION

[7] A HEURISTIC APPROACH TO THE BUS DRIVER SCHEDULING PROBLEM [J].

MARTELLO, S ;

TOTH, P .

[8]

Shamos Michael Ian, 1976, 17TH P ANN IEEE S F, P208