Besides scheduling problems for single and parallel machines and shop scheduling problems the book covers advanced models involving due-dates, sequence dependent change over times and batching. Also multiprocessor task scheduling and problems with multi-purpose machines are discussed. The methods used to solve these problems are polynomial algorithms, dynamic programming procedures, branch-and-bound algorithms and local search heuristics. Also complexity issues are addressed.
What people are saying - Write a review
We haven't found any reviews in the usual places.
Other editions - View all
according to nondecreasing arbitrary assignment problem assume batch block branch and bound Brucker calculated changeover Cmax computational consider corresponding decision problem defined disjunctive arcs dopt due-dates dynamic programming exists an optimal feasible schedule feasible solution finish flow shop problem Furthermore given Hoogeveen integer interval intree job Ji job shop problem jobs scheduled late jobs Lemma Lenstra Limax linear program Lmax lower bound M'P-hard machines M1 maximum flow problem minimal Monge array node number of jobs O(n log objective function objective value open shop problem optimal schedule optimal sequence outtree parallel machines partial schedule pmtn polynomially solvable prec precedence constraints preemption preemptive schedule priority queue procedure Proof recursion release dates schedule job scheduling problems set of jobs shortest path problem shown in Figure slot solved in O(n stages steps successors Theorem vertex vertices weights XD w;C