A DYNAMIC-PROGRAMMING APPROACH FOR SEQUENCING GROUPS OF IDENTICAL JOBS

[1] FINDING AN OPTIMAL SEQUENCE BY DYNAMIC-PROGRAMMING - EXTENSION TO PRECEDENCE-RELATED TASKS [J]. OPERATIONS RESEARCH, 1978, 26 (01) : 111 - 120

[2] THE LANDING CAPACITY OF A RUNWAY [J]. OPERATIONS RESEARCH, 1959, 7 (06) : 752 - 763

[3] Coffman E.G., 1976, COMPUTER JOB SHOP SC

[4] DEAR RG, 1976, R769 FTL MIT FLIGHT

[5] HELD M, 1962, SIAM, V19, P196

[6] ON SCHEDULING PROBLEMS WITH DEFERRAL COSTS [J]. MANAGEMENT SCIENCE, 1964, 11 (02) : 280 - 288

[7] Lawler EL., 1978, ANN DISCRETE MATH, V2, P75

[8] A DYNAMIC-PROGRAMMING SOLUTION TO THE SINGLE VEHICLE MANY-TO-MANY IMMEDIATE REQUEST DIAL-A-RIDE PROBLEM [J]. TRANSPORTATION SCIENCE, 1980, 14 (02) : 130 - 154

[9] PSARAFTIS HN, 1978, R784 FTL MIT FLIGHT

[10] DYNAMIC-PROGRAMMING SOLUTION OF SEQUENCING PROBLEMS WITH PRECEDENCE CONSTRAINTS [J]. OPERATIONS RESEARCH, 1978, 26 (03) : 444 - 449

[1] FINDING AN OPTIMAL SEQUENCE BY DYNAMIC-PROGRAMMING - EXTENSION TO PRECEDENCE-RELATED TASKS [J]. OPERATIONS RESEARCH, 1978, 26 (01) : 111 - 120

[2] THE LANDING CAPACITY OF A RUNWAY [J]. OPERATIONS RESEARCH, 1959, 7 (06) : 752 - 763

[3] Coffman E.G., 1976, COMPUTER JOB SHOP SC

[4] DEAR RG, 1976, R769 FTL MIT FLIGHT

[5] HELD M, 1962, SIAM, V19, P196

[6] ON SCHEDULING PROBLEMS WITH DEFERRAL COSTS [J]. MANAGEMENT SCIENCE, 1964, 11 (02) : 280 - 288

[7] Lawler EL., 1978, ANN DISCRETE MATH, V2, P75

[8] A DYNAMIC-PROGRAMMING SOLUTION TO THE SINGLE VEHICLE MANY-TO-MANY IMMEDIATE REQUEST DIAL-A-RIDE PROBLEM [J]. TRANSPORTATION SCIENCE, 1980, 14 (02) : 130 - 154

[9] PSARAFTIS HN, 1978, R784 FTL MIT FLIGHT

[10] DYNAMIC-PROGRAMMING SOLUTION OF SEQUENCING PROBLEMS WITH PRECEDENCE CONSTRAINTS [J]. OPERATIONS RESEARCH, 1978, 26 (03) : 444 - 449