Scheduling Algorithms: Edition 3
mar. 2013 · Springer Science & Business Media
E-knjiga
365
Strani
O tej e-knjigi
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.
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.
Ocenite to e-knjigo
Povejte nam svoje mnenje.
Informacije o branju
Pametni telefoni in tablični računalniki
Namestite aplikacijo Knjige Google Play za Android in iPad/iPhone. Samodejno se sinhronizira z računom in kjer koli omogoča branje s povezavo ali brez nje.
Prenosni in namizni računalniki
Poslušate lahko zvočne knjige, ki ste jih kupili v Googlu Play v brskalniku računalnika.
Bralniki e-knjig in druge naprave
Če želite brati v napravah, ki imajo zaslone z e-črnilom, kot so e-bralniki Kobo, morate prenesti datoteko in jo kopirati v napravo. Podrobna navodila za prenos datotek v podprte bralnike e-knjig najdete v centru za pomoč.
