Scheduling Algorithms

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 use...

Full description

Main Author: Brucker, Peter
Corporate Author: SpringerLink (Online service)
Format: eBook
Language:English
Published: Berlin, Heidelberg Springer Berlin Heidelberg 2007, 2007
Edition:5th ed. 2007
Subjects:
Online Access:
Collection: Springer eBooks 2005- - Collection details see MPG.ReNa
LEADER 01870nmm a2200313 u 4500
001 EB000378020
003 EBX01000000000000000231072
005 00000000000000.0
007 cr|||||||||||||||||||||
008 130626 ||| eng
020 |a 9783540695165 
100 1 |a Brucker, Peter 
245 0 0 |a Scheduling Algorithms  |h Elektronische Ressource  |c by Peter Brucker 
250 |a 5th ed. 2007 
260 |a Berlin, Heidelberg  |b Springer Berlin Heidelberg  |c 2007, 2007 
300 |a XII, 371 p. 77 illus  |b online resource 
505 0 |a Classification of Scheduling Problems -- Some Problems in Combinatorial Optimization -- Computational Complexity -- Single Machine Scheduling Problems -- Parallel Machines -- Shop Scheduling Problems -- Due-Date Scheduling -- Batching Problems -- Changeover Times and Transportation Times -- Multi-Purpose Machines -- Multiprocessor Tasks 
653 |a Operations research 
653 |a Production management 
653 |a Operations Research, Management Science 
653 |a Operations Management 
653 |a Operations Research/Decision Theory 
710 2 |a SpringerLink (Online service) 
041 0 7 |a eng  |2 ISO 639-2 
989 |b Springer  |a Springer eBooks 2005- 
856 |u https://doi.org/10.1007/978-3-540-69516-5?nosfx=y  |x Verlag  |3 Volltext 
082 0 |a 658.40301 
520 |a 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