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

Πλήρης περιγραφή

Λεπτομέρειες βιβλιογραφικής εγγραφής
Κύριος συγγραφέας: Brucker, Peter (Συγγραφέας)
Συγγραφή απο Οργανισμό/Αρχή: SpringerLink (Online service)
Μορφή: Ηλεκτρονική πηγή Ηλ. βιβλίο
Γλώσσα:English
Έκδοση: Berlin, Heidelberg : Springer Berlin Heidelberg, 2007.
Έκδοση:Fifth Edition.
Θέματα:
Διαθέσιμο Online:Full Text via HEAL-Link
LEADER 02442nam a22004935i 4500
001 978-3-540-69516-5
003 DE-He213
005 20151204142013.0
007 cr nn 008mamaa
008 100301s2007 gw | s |||| 0|eng d
020 |a 9783540695165  |9 978-3-540-69516-5 
024 7 |a 10.1007/978-3-540-69516-5  |2 doi 
040 |d GrThAP 
050 4 |a HD30.23 
072 7 |a KJT  |2 bicssc 
072 7 |a KJMD  |2 bicssc 
072 7 |a BUS049000  |2 bisacsh 
082 0 4 |a 658.40301  |2 23 
100 1 |a Brucker, Peter.  |e author. 
245 1 0 |a Scheduling Algorithms  |h [electronic resource] /  |c by Peter Brucker. 
250 |a Fifth Edition. 
264 1 |a Berlin, Heidelberg :  |b Springer Berlin Heidelberg,  |c 2007. 
300 |a XII, 371 p. 77 illus.  |b online resource. 
336 |a text  |b txt  |2 rdacontent 
337 |a computer  |b c  |2 rdamedia 
338 |a online resource  |b cr  |2 rdacarrier 
347 |a text file  |b PDF  |2 rda 
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. 
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. 
650 0 |a Business. 
650 0 |a Production management. 
650 0 |a Operations research. 
650 0 |a Decision making. 
650 0 |a Management science. 
650 1 4 |a Business and Management. 
650 2 4 |a Operation Research/Decision Theory. 
650 2 4 |a Operations Research, Management Science. 
650 2 4 |a Operations Management. 
710 2 |a SpringerLink (Online service) 
773 0 |t Springer eBooks 
776 0 8 |i Printed edition:  |z 9783540695158 
856 4 0 |u http://dx.doi.org/10.1007/978-3-540-69516-5  |z Full Text via HEAL-Link 
912 |a ZDB-2-SBE 
950 |a Business and Economics (Springer-11643)