A MACHINE-JOB SCHEDULING MODEL

[1] Bellman R.E., 1958, J Q APPL MATH, V16, P87

[2] DANTZIG G, 1960, MANAGEMENT SCI, V6

[3] A SUGGESTED COMPUTATION FOR MAXIMAL MULTICOMMODITY NETWORK FLOWS [J]. MANAGEMENT SCIENCE, 1958, 5 (01) : 97 - 101

[4] FORD LR, 1958, RAND P1114 CORP PAP

[5] FORD LR, 1956, RAND P923 CORP PAP

[6] GOMORY RE, 1958, B AM MATH SOC, V64

[7] Johnson S. M., 1954, NAV RES LOGIST Q, V1, P61, DOI DOI 10.1002/NAV.3800010110

[8] MOORE EF, UNPUB SHORTEST PATH

[9] METHODS OF SEQUENCING IN JOB SHOPS - A REVIEW [J]. OPERATIONS RESEARCH, 1959, 7 (01) : 10 - 29

[1] Bellman R.E., 1958, J Q APPL MATH, V16, P87

[2] DANTZIG G, 1960, MANAGEMENT SCI, V6

[3] A SUGGESTED COMPUTATION FOR MAXIMAL MULTICOMMODITY NETWORK FLOWS [J]. MANAGEMENT SCIENCE, 1958, 5 (01) : 97 - 101

[4] FORD LR, 1958, RAND P1114 CORP PAP

[5] FORD LR, 1956, RAND P923 CORP PAP

[6] GOMORY RE, 1958, B AM MATH SOC, V64

[7] Johnson S. M., 1954, NAV RES LOGIST Q, V1, P61, DOI DOI 10.1002/NAV.3800010110

[8] MOORE EF, UNPUB SHORTEST PATH

[9] METHODS OF SEQUENCING IN JOB SHOPS - A REVIEW [J]. OPERATIONS RESEARCH, 1959, 7 (01) : 10 - 29