Strusevich, V.

schedule algorithm route schedule sk machine length job q problem scheduling processing two-machine 3/2 algorithm algorithm 1 route-dependent processing times ∪ nba lemma theorem list l inequality 3/2 sk −1 strusevich ≤ cmax fi xed jobs section subset workload machine b proof algorithm 2 model waart dekker heuristic j ∈ n sequence transformation ratio ≤ 1 cmax makespan processing route fi xed iteration priority inequality t non-increasing order shop problem schedule sg processing times order analysis performance route-dependent ¯ ¯ cmax change value approximation ≤ 3 cmax guarantee changeover algorithm 2. fi nding 3/2 times changeover job condition performance ratio theorem 3 paper shape changeover job v q ⊆ n priority scheduling algorithm process fi rst case ≥ 1 1 ∪ nba ∪ inequality cmax shop scheduling problem j ∈ q j =1 ¯