64,95 €
64,95 €
inkl. MwSt.
Sofort per Download lieferbar
32 °P sammeln
64,95 €
Als Download kaufen
64,95 €
inkl. MwSt.
Sofort per Download lieferbar
32 °P sammeln
Jetzt verschenken
Alle Infos zum eBook verschenken
64,95 €
inkl. MwSt.
Sofort per Download lieferbar
Alle Infos zum eBook verschenken
32 °P sammeln
Andere Kunden interessierten sich auch für
![Scheduling Algorithms (eBook, PDF)]( "Scheduling Algorithms (eBook, PDF)")
Scheduling Algorithms (eBook, PDF)64,95 €![Modelling and Simulation in Air Traffic Management (eBook, PDF)]( "Modelling and Simulation in Air Traffic Management (eBook, PDF)")
Modelling and Simulation in Air Traffic Management (eBook, PDF)112,95 €![Computer-Aided Scheduling of Public Transport (eBook, PDF)]( "Computer-Aided Scheduling of Public Transport (eBook, PDF)")
Computer-Aided Scheduling of Public Transport (eBook, PDF)72,95 €![Artificial Intelligence, Learning and Computation in Economics and Finance (eBook, PDF)]( "Artificial Intelligence, Learning and Computation in Economics and Finance (eBook, PDF)")
Artificial Intelligence, Learning and Computation in Economics and Finance (eBook, PDF)112,95 €![Accuracy Improvements in Linguistic Fuzzy Modeling (eBook, PDF)]( "Accuracy Improvements in Linguistic Fuzzy Modeling (eBook, PDF)")
Accuracy Improvements in Linguistic Fuzzy Modeling (eBook, PDF)112,95 €![Managing Complexity: Insights, Concepts, Applications (eBook, PDF)]( "Managing Complexity: Insights, Concepts, Applications (eBook, PDF)")
Managing Complexity: Insights, Concepts, Applications (eBook, PDF)72,95 €![Business Process Modelling (eBook, PDF)]( "Business Process Modelling (eBook, PDF)")
Business Process Modelling (eBook, PDF)112,95 €
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.
Dieser Download kann aus rechtlichen Gründen nur mit Rechnungsadresse in A, B, BG, CY, CZ, D, DK, EW, E, FIN, F, GR, HR, H, IRL, I, LT, L, LR, M, NL, PL, P, R, S, SLO, SK ausgeliefert werden.