A Price-directed Approach to Real-time Scheduling of Production Operations |
Common terms and phrases
algorithm array[1..jobcon array[1..stacon become idle begin end begin termin(input Best Schedule Cost best_prio boolean Carnegie-Mellon University cost function cost_end cost_next cost[spoint cost[spoint(station[j,o]]+task[j,o]-1 data sets denotes dispatching rules downto dual due dates end end first_time first_time[s flowshop formulation go to Step icut icut[k individual work stations integer integer programming ipoint[i job-shop lam_len lam[r lamcount/4 last_time Lemma looper machine capacity constraints machine+1 marked arcs markx marky markz matbool matreal Maximum Flow Problem Morton normsubg num_of_jobs do begin num_of_stations do begin numjobs numstations one-machine heuristics one-machine scheduling problems operation ops[j ops[k Optimal Cost pass2 path of marked prio prio3 Pritsker Problem Size proc proc_time procedure ptype read(intext readln(pass ready[j route scheduling theory solves spoint station[j,o step3 subg subgradient t-timer-proc task(j,o task[s tcon temp temp2 termout output timer timer+proc trunc vecints vecreal Wjit writeln(out writeln(outtext writeln(pass xjit z machine z[machine Σ Σ