Computer and Job-shop Scheduling TheoryIntroduction to deterministic scheduling theory; Algorithms for minimal-length schedulesComplexity of sequencing problems; Enumerative and iterative computationsl approaches. |
Common terms and phrases
algorithm applied arbitrary assigned assume b₁ begin bound branch-and-bound branching node called Chapter complete computational Consequently consider consists construct contains corresponding cost currently defined definition denote determine elements eliminated empty example execution exists expression feasible Figure Finally finishing function give given graph immediate increase indices inductive initial input instance known labeling least Lemma length limit lower lower-bound mean minimal neighborhood node Note NP-complete obtain optimal permutation optimal schedule optimal solution p-maximal parameters partial path performance polynomial positive possible procedure processing processors programming Proof proved relation represent requirements resource respect rule satisfiable scheduling problem selection sequence shown solution starting step storage Suppose T₁ takes task system termination Theorem tree true unit upper-bound variables weighted