Scheduling algorithms
Autor(en): | Brucker, P. | Erscheinungsdatum: | 2007 | Herausgeber: | Springer Berlin Heidelberg | Journal: | Scheduling Algorithms | Startseite: | 1 | Seitenende: | 371 | Zusammenfassung: | 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 multi-purpose 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 different classes of deterministic scheduling problems are summerized. © Springer-Verlag Berlin Heidelberg 2007. All rights are reserved. |
ISBN: | 9783540695158 | DOI: | 10.1007/978-3-540-69516-5 | Externe URL: | https://www.scopus.com/inward/record.uri?eid=2-s2.0-84891459569&doi=10.1007%2f978-3-540-69516-5&partnerID=40&md5=2fcf27b8ae03442cb2f456c398ea0d39 |
Show full item record