## A price-directed approach to real-time scheduling of production operations |

### What people are saying - Write a review

We haven't found any reviews in the usual places.

### Common terms and phrases

array[1..jobcon array[1..lamcon array[1..stacon augument the flow become idle begin main program begin temp begin termin(input Best Schedule Cost best_prio boolean Bound on Optimal Bound Ratios Carnegie-Mellon University cost function Cost to Bound cost[spoint[station[j,o]]+task[j,o]-l,time+l cost[spoint[station[j,o]]+task[j,o]-l.time data sets denotes dispatching rules downto dual end end first_time[s first_time[station[j,o flowshop formulation freetime[s go to Step i,t+l icut icut[k,machine+l individual work stations integer programming job-shop k,t+l lam_len do begin lam[r lambda[r lamcount last_time[s last_time[station[j,o Lemma looper machine capacity constraints marked arcs markz matbool matreal Maximum Flow Problem Morton nextop[j node i,t normsubg num_of_jobs do begin num_of_stations do begin numstations oldtb one-machine heuristics one-machine scheduling problems ops[j ops[k Optimal Cost path of marked poor lower bounds prio Pritsker Problem Size procedure readln(pass ready[j round(time/4 route[s scheduling theory simple cycle solves spoint[s spoint[station[j,o subgradient task[s temp2 termout(output timer total weighted tardiness true end type matintjs vecints vecreal writeln(outtext writeln(pass2 z[i,time z[machine,time z[n,time