SCHEDULING THE OPEN SHOP TO MINIMIZE MEAN FLOW TIME

[1] ACHUGBUE JO, 1979, 799 U ALB DEP COMP S

[2] ACHUGBUE JO, 1982, MATH OPER RES MAY

[3] ACHUGBUE JO, 1980, THESIS U ALBERTA EDM

[4] ON J-MAXIMAL AND J-MINIMAL FLOWSHOP SCHEDULES [J]. JOURNAL OF THE ACM, 1981, 28 (03) : 462 - 476

[5] COFFMAN EG, 1976, COMPUTER JOBSHOP SCH

[6] Conway R, 1967, THEORY SCHEDULING

[7] Garey M. R., 1976, Mathematics of Operations Research, V1, P117, DOI 10.1287/moor.1.2.117

[8] GONZALEZ T, 1976, J ACM, V23, P665, DOI 10.1145/321978.321985

[9] FLOW-SHOP AND JOB-SHOP SCHEDULES - COMPLEXITY AND APPROXIMATION [J]. OPERATIONS RESEARCH, 1978, 26 (01) : 36 - 52

[10] GONZALEZ T, 1976, 214 PENN STAT U COMP

[1] ACHUGBUE JO, 1979, 799 U ALB DEP COMP S

[2] ACHUGBUE JO, 1982, MATH OPER RES MAY

[3] ACHUGBUE JO, 1980, THESIS U ALBERTA EDM

[4] ON J-MAXIMAL AND J-MINIMAL FLOWSHOP SCHEDULES [J]. JOURNAL OF THE ACM, 1981, 28 (03) : 462 - 476

[5] COFFMAN EG, 1976, COMPUTER JOBSHOP SCH

[6] Conway R, 1967, THEORY SCHEDULING

[7] Garey M. R., 1976, Mathematics of Operations Research, V1, P117, DOI 10.1287/moor.1.2.117

[8] GONZALEZ T, 1976, J ACM, V23, P665, DOI 10.1145/321978.321985

[9] FLOW-SHOP AND JOB-SHOP SCHEDULES - COMPLEXITY AND APPROXIMATION [J]. OPERATIONS RESEARCH, 1978, 26 (01) : 36 - 52

[10] GONZALEZ T, 1976, 214 PENN STAT U COMP