▁Ch ardon ▁and ▁Mou k rim : ▁The ▁C off man - G raham ▁algorithm ▁optim ally ▁solves ▁U ET ▁task ▁systems ▁with ▁over interval ▁orders , ▁SI AM ▁Journal ▁on ▁Dis crete ▁Mathemat ics , ▁ 1 9 ( 1 ): 1 0 9 - 1 2 1 , ▁ 2 0 0 5 . ▁ ▁Am - order ▁ ▁Am ▁orders ▁are ▁a ▁super class ▁of ▁over - interval ▁orders ▁defined ▁in ▁Mou k rim ▁and ▁Qu illi ot : ▁A ▁relation ▁between ▁multip ro cess or ▁sched uling ▁and ▁linear ▁programming . ▁Order , ▁ 1 4 ( 3 ): 2 6 9 - 2 7 8 , ▁ 1 9 9 7 . ▁ ▁DC - graph ▁ ▁A ▁divide - and - con quer ▁graph ▁is ▁a ▁subclass ▁of ▁series - parallel ▁graphs ▁defined ▁in ▁Kub iak ▁et ▁al .: ▁Opt im ality ▁of ▁H L F ▁for ▁sched uling ▁divide - and - con quer ▁U ET ▁task ▁graphs ▁on ▁identical ▁parallel ▁process ors . ▁Dis crete ▁Opt im ization , ▁ 6 : 7 9 - 9 1 , ▁ 2 0 0 9 . ▁▁ 2 - dim ▁partial ▁order ▁ ▁A ▁ 2 - dimensional ▁partial ▁order ▁is ▁a ▁k - dimensional ▁partial ▁order ▁for ▁k = 2 . ▁ ▁k - dim ▁partial ▁order ▁ ▁A ▁pos et ▁is ▁a ▁k - dimensional ▁partial ▁order ▁if f ▁it ▁can ▁be ▁embedded ▁into ▁the ▁k - dimensional ▁E uclidean ▁space ▁in ▁such ▁a ▁way