Modeling and Optimization of Traffic Flow in Urban Areas - Czech ...

Appendix ATORSCHE AlgorithmsA.1 Scheduling Algorithmsalgorithm command problemAlgorithm for 1|r j |C max alg1rjcmax 1|r j |C maxBratley’s Algorithm bratley 1|r j , ˜d j |C maxHorn’s Algorithm horn 1|pmtn, r j |L maxHodgson’s Algorithm alg1sumuj 1|| ∑ U jAlgorithm for 1|| ∑ w j D j alg1sumwjdj 1|| ∑ w j D jAlgorithm for P ||C max algpcmax P ||C maxDynamic Prog. and P ||C max algpcmaxdp P ||CmaxMcNaughton’s Algorithm mcnaughtonrule P |pmtn|C maxAlgorithm for P |r j , prec, ˜d j |C max algprjdeadlinepreccmax P |r j , prec, ˜d j |C maxHu’s Algorithm hu P |in-tree, p j = 1|C maxBrucker’s algorithm brucker76 P |in-tree, p j = 1|L maxList Scheduling listsch P |prec|C maxCoffman’s and Graham’s Algorithm coffmangraham P 2|prec, p j = 1|C maxSAT Scheduling satsch P |prec|C maxJohnson’s Algorithm johnson F 2||C maxGonzales Sahni’s Algorithm gonzalezsahni O2||C maxJackson’s Algorithm jackson J2|n j ≤ 2|C maxAlgorithm cpshopscheduler cpshopscheduler J, F, O||C maxAlg. for F 2, R1|p ij = 1, t j |C max algf2r1pijtjcmax F 2, R1|p ij = 1, t j |C maxAlg. for F ||C max with lim. buffers fslbAlg. for O|p ij = 1| ∑ T i algopij1sumtiF ||C maxO|p i = 1| ∑ T iPositive and Negative Time-Lags spntl SP NT LCyclic scheduling (General) cycsch CSCHSAT Scheduling satsch P |prec|C max67