Scheduling algorithms

DC ElementWertSprache
dc.contributor.authorBrucker, P.
dc.date.accessioned2021-12-23T16:29:53Z-
dc.date.available2021-12-23T16:29:53Z-
dc.date.issued2007
dc.identifier.isbn9783540695158
dc.identifier.urihttps://osnascholar.ub.uni-osnabrueck.de/handle/unios/16410-
dc.description.abstractBesides 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.
dc.language.isoen
dc.publisherSpringer Berlin Heidelberg
dc.relation.ispartofScheduling Algorithms
dc.titleScheduling algorithms
dc.typebook
dc.identifier.doi10.1007/978-3-540-69516-5
dc.identifier.scopus2-s2.0-84891459569
dc.identifier.urlhttps://www.scopus.com/inward/record.uri?eid=2-s2.0-84891459569&doi=10.1007%2f978-3-540-69516-5&partnerID=40&md5=2fcf27b8ae03442cb2f456c398ea0d39
dc.description.startpage1
dc.description.endpage371
dcterms.isPartOf.abbreviationScheduling Algorithms
Zur Kurzanzeige

Google ScholarTM

Prüfen

Altmetric