TY - BOOK ID - 5406420 TI - Scheduling Algorithms PY - 2007 SN - 9783540695158 354069515X 3642089070 9786610960163 1280960167 3540695168 PB - Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, DB - UniCat KW - Computer capacity KW - Production scheduling. KW - Computer algorithms. KW - Capacité de traitement KW - Ordonnancement (Gestion) KW - Algorithmes KW - Planning. KW - Planification KW - Computer capacity. KW - Engineering & Applied Sciences KW - Computer Science KW - Production scheduling KW - Computer algorithms KW - Management Theory KW - Management KW - Business & Economics KW - Planning KW - Capacité de traitement KW - EPUB-LIV-FT LIVECONO LIVGESTI SPRINGER-B KW - Job scheduling (Production control) KW - Job-shop scheduling KW - Project scheduling (Production control) KW - Scheduling (Management) KW - Business. KW - Production management. KW - Operations research. KW - Decision making. KW - Management science. KW - Business and Management. KW - Operation Research/Decision Theory. KW - Operations Research, Management Science. KW - Operations Management. KW - Production control KW - Scheduling KW - Algorithms KW - Operations Research/Decision Theory. KW - Manufacturing management KW - Industrial management KW - Operational analysis KW - Operational research KW - Industrial engineering KW - Management science KW - Research KW - System theory KW - Quantitative business analysis KW - Problem solving KW - Operations research KW - Statistical decision KW - Deciding KW - Decision (Psychology) KW - Decision analysis KW - Decision processes KW - Making decisions KW - Management decisions KW - Choice (Psychology) KW - Decision making UR - https://www.unicat.be/uniCat?func=search&query=sysid:5406420 AB - 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. ER -