SCHEDULING WITH PARALLEL PROCESSORS AND LINEAR DELAY COSTS

[1] ABRAMOWITZ M, 1964, HDB MATHEMATICAL FUN

[2] OPTIMAL USER SEARCH SEQUENCES AND IMPLICATIONS FOR INFORMATION SYSTEMS OPERATION [J]. AMERICAN DOCUMENTATION, 1969, 20 (03): : 203 - 212

[3] PRIORITY ASSIGNMENT IN A NETWORK OF COMPUTERS [J]. IEEE TRANSACTIONS ON COMPUTERS, 1969, C 18 (11) : 1021 - &

[4] COFFMAN EG, 1969, 24 P ACM NAT C, P217

[5] CONWAY RW, 1970, THEORY SCHEDULING

[6] DENBY DC, 1967, J IND ENG, V17, P436

[7] BOUNDS FOR THE OPTIMAL SCHEDULING OF NORMAL-JOBS ON META-PROCESSORS [J]. MANAGEMENT SCIENCE, 1964, 11 (02) : 268 - 279

[8] Feller W., 1957, INTRO PROBABILITY TH, V1

[9] SEQUENCING OPERATIONS TO MINIMIZE IN-PROCESS INVENTORY COSTS [J]. MANAGEMENT SCIENCE, 1965, 11 (03) : 476 - 484

[10] GRIESHOP DS, 1972, THESIS GEORGIA I TEC

[1] ABRAMOWITZ M, 1964, HDB MATHEMATICAL FUN

[2] OPTIMAL USER SEARCH SEQUENCES AND IMPLICATIONS FOR INFORMATION SYSTEMS OPERATION [J]. AMERICAN DOCUMENTATION, 1969, 20 (03): : 203 - 212

[3] PRIORITY ASSIGNMENT IN A NETWORK OF COMPUTERS [J]. IEEE TRANSACTIONS ON COMPUTERS, 1969, C 18 (11) : 1021 - &

[4] COFFMAN EG, 1969, 24 P ACM NAT C, P217

[5] CONWAY RW, 1970, THEORY SCHEDULING

[6] DENBY DC, 1967, J IND ENG, V17, P436

[7] BOUNDS FOR THE OPTIMAL SCHEDULING OF NORMAL-JOBS ON META-PROCESSORS [J]. MANAGEMENT SCIENCE, 1964, 11 (02) : 268 - 279

[8] Feller W., 1957, INTRO PROBABILITY TH, V1

[9] SEQUENCING OPERATIONS TO MINIMIZE IN-PROCESS INVENTORY COSTS [J]. MANAGEMENT SCIENCE, 1965, 11 (03) : 476 - 484

[10] GRIESHOP DS, 1972, THESIS GEORGIA I TEC