▁ ▁Sometimes ▁the ▁meaning ▁of ▁ ▁is ▁invert ed ▁in ▁the ▁literature , ▁which ▁is ▁equivalent ▁when ▁considering ▁the ▁decision ▁version ▁of ▁the ▁problem , ▁but ▁which ▁makes ▁a ▁huge ▁difference ▁for ▁approxim ations . ▁▁▁ ▁T ard iness . ▁Every ▁job ▁ ▁is ▁given ▁a ▁due ▁date ▁. ▁The ▁tard iness ▁of ▁job ▁ ▁is ▁defined ▁as ▁. ▁▁▁ ▁Ear lin ess . ▁Every ▁job ▁ ▁is ▁given ▁a ▁due ▁date ▁. ▁The ▁ear lin ess ▁of ▁job ▁ ▁is ▁defined ▁as ▁. ▁ ▁This ▁objective ▁is ▁important ▁for ▁just - in - time ' ▁sched uling . ▁▁ ▁Ex amples ▁ ▁Ada pt ed ▁from ▁▁▁▁ 1 | prec | ▁a ▁single ▁machine , ▁general ▁preced ence ▁constraint , ▁minim izing ▁maximum ▁laten ess . ▁▁ ▁R | pm tn | ▁variable ▁number ▁of ▁un related ▁parallel ▁machines , ▁allowing ▁pre em ption , ▁minim izing ▁total ▁completion ▁time . ▁▁ ▁J 3 || ▁ 3 - m ach ines ▁job ▁shop ▁with ▁unit ▁processing ▁times , ▁minim izing ▁maximum ▁completion ▁time . ▁▁ ▁References ▁▁ ▁B . ▁Chen , ▁C . N . ▁Pot ts ▁and ▁G . J . ▁Wo eg inger . ▁" A ▁review ▁of ▁machine ▁sched uling : ▁Complex ity , ▁algorithms ▁and ▁approxim ability ". ▁Hand book ▁of ▁Com bin atorial ▁Opt im ization '' ▁( Volume ▁ 3 ) ▁( Edit ors : ▁D .- Z . ▁Du ▁and ▁P . ▁P ard al os ), ▁ 1 9 9 8 , ▁K lu