Kolen, A.W.J.

machine problem shift class number instance algorithm schedule scheduling proof solution complexity engineer interval lemma polynomial time theorem result section kolen processing kroon value license vertex processing time figure polynomial matrix job overlap job class 1 lot-sizing problem aircraft integer matrix l classification example t h e j jobs assignment period graph heuristic lot-sizing job j overlap combination machine class 3 research machine class 1 license combination c statement arc algorithm a.w.j shift z network subset production job class 2 job scheduling problem kroon / iteration yes-instance n-job instance permutation column end times job 1 job class breakpoint np-hard version kroon / analysis np-complete s-set algorithm paper analysis backpointer n 3dm inequality