Scheduling Algorithms

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.

שנה

1995

שפה

English

הוצאה

Springer Berlin Heidelberg

מהדורות

1

עמודים

326

ISBN

9783662030905

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