▁is ▁always ▁possible ▁to ▁find ▁a ▁schedule ▁that ▁uses ▁at ▁most ▁one ▁more ▁week end ▁than ▁there ▁are ▁games ▁per ▁team . ▁ ▁Open ▁shop ▁sched uling ▁is ▁a ▁problem ▁of ▁sched uling ▁production ▁processes , ▁in ▁which ▁there ▁are ▁a ▁set ▁of ▁objects ▁to ▁be ▁manufact ured , ▁each ▁object ▁has ▁a ▁set ▁of ▁tasks ▁to ▁be ▁performed ▁on ▁it ▁( in ▁any ▁order ), ▁and ▁each ▁task ▁must ▁be ▁performed ▁on ▁a ▁specific ▁machine , ▁prevent ing ▁any ▁other ▁task ▁that ▁requires ▁the ▁same ▁machine ▁from ▁being ▁performed ▁at ▁the ▁same ▁time . ▁If ▁all ▁tasks ▁have ▁the ▁same ▁length , ▁then ▁this ▁problem ▁may ▁be ▁formal ized ▁as ▁one ▁of ▁edge ▁color ing ▁a ▁b ipart ite ▁mult ig raph , ▁in ▁which ▁the ▁vertices ▁on ▁one ▁side ▁of ▁the ▁b ipart ition ▁represent ▁the ▁objects ▁to ▁be ▁manufact ured , ▁the ▁vertices ▁on ▁the ▁other ▁side ▁of ▁the ▁b ipart ition ▁represent ▁the ▁manufact uring ▁machines , ▁the ▁edges ▁represent ▁tasks ▁that ▁must ▁be ▁performed , ▁and ▁the ▁colors ▁represent ▁time ▁steps ▁in ▁which ▁each ▁task ▁may ▁be ▁performed . ▁Since ▁b ipart ite ▁edge ▁color ing ▁may ▁be ▁performed ▁in ▁polynomial ▁time , ▁the ▁same ▁is ▁true ▁for ▁this ▁restricted ▁case ▁of ▁open ▁shop ▁sched uling . ▁▁ ▁study ▁the ▁problem ▁of ▁link ▁sched uling ▁for ▁time ▁division ▁multiple ▁access ▁network ▁communic ations ▁protocol s ▁on ▁sensor ▁networks ▁as ▁a ▁variant ▁of ▁edge ▁color ing . ▁In ▁this ▁problem , ▁one ▁must ▁choose ▁time ▁sl ots ▁for ▁the