Check nearby libraries
Buy this book
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. In the third edition of the book the complexity status of the different classes of scheduling problems is updated and corresponding references are added. New polynomial algorithms for single machine problems with release times and constant processing times are added.
Check nearby libraries
Buy this book
Previews available in: English
Edition | Availability |
---|---|
1
Scheduling Algorithms
2001, Springer Berlin Heidelberg
electronic resource /
in English
- Third Edition.
3662045524 9783662045527
|
aaaa
Libraries near you:
WorldCat
|
Book Details
Table of Contents
Edition Notes
Online full text is restricted to subscribers.
Also available in print.
Mode of access: World Wide Web.
Classifications
The Physical Object
ID Numbers
Community Reviews (0)
Feedback?July 7, 2019 | Created by MARC Bot | import new book |