Scheduling Algorithms

Besides scheduling problems for single and parallel machines and shop scheduling problems the book covers advanced models involving due-dates, sequence dependent changeover times and batching. Also multiprocessor task scheduling and problems with multipurpose machines are discussed. The methods used to solve these problems are linear programming, dynamic programming, branch-and-bound algorithms, and local search heuristics. Complexity results for the different classes of deterministic scheduling problems are summarized.

שנה

1998

שפה

English

הוצאה

Springer Berlin Heidelberg

מהדורות

4

עמודים

342

ISBN

9783662036143

מקור הנתונים: Wikidata