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 multipurpose machines are discussed. The methods used...

Full description

Bibliographic Details
Main Author: Brucker, Peter
Format: eBook
Language:English
Published: Berlin, Heidelberg Springer Berlin Heidelberg 1998, 1998
Edition:2nd ed. 1998
Subjects:
Online Access:
Collection: Springer Book Archives -2004 - Collection details see MPG.ReNa
LEADER 01992nmm a2200337 u 4500
001 EB000686335
003 EBX01000000000000000539417
005 00000000000000.0
007 cr|||||||||||||||||||||
008 140122 ||| eng
020 |a 9783662036129 
100 1 |a Brucker, Peter 
245 0 0 |a Scheduling Algorithms  |h Elektronische Ressource  |c by Peter Brucker 
250 |a 2nd ed. 1998 
260 |a Berlin, Heidelberg  |b Springer Berlin Heidelberg  |c 1998, 1998 
300 |a XII, 342 p  |b online resource 
505 0 |a 1 Classification of Scheduling Problems -- 2 Some Problems in Combinatorial Optimization -- 3 Computational Complexity -- 4 Single Machine Scheduling Problems -- 5 Parallel Machines -- 6 Shop Scheduling Problems -- 7 Due-Date Scheduling -- 8 Batching Problems -- 9 Changeover Times and Transportation Times -- 10 Multi-Purpose Machines -- 11 Multiprocessor Tasks -- References 
653 |a Calculus of Variations and Optimal Control; Optimization 
653 |a Complexity 
653 |a Planning 
653 |a Organization 
653 |a Computer organization 
653 |a Computational complexity 
653 |a Organization 
653 |a Computer Systems Organization and Communication Networks 
653 |a Calculus of variations 
041 0 7 |a eng  |2 ISO 639-2 
989 |b SBA  |a Springer Book Archives -2004 
856 4 0 |u https://doi.org/10.1007/978-3-662-03612-9?nosfx=y  |x Verlag  |3 Volltext 
082 0 |a 658.1 
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 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