Cargando…

Time-Dependent Scheduling

Time-dependent scheduling involves problems in which the processing times of jobs depend on when those jobs are started. This book is a comprehensive study of complexity results and optimal and suboptimal algorithms concerning time-dependent scheduling in single-, parallel- and dedicated-machine env...

Descripción completa

Detalles Bibliográficos
Clasificación:Libro Electrónico
Autor principal: Gawiejnowicz, Stanislaw (Autor)
Autor Corporativo: SpringerLink (Online service)
Formato: Electrónico eBook
Idioma:Inglés
Publicado: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2008.
Edición:1st ed. 2008.
Colección:Monographs in Theoretical Computer Science. An EATCS Series,
Temas:
Acceso en línea:Texto Completo

MARC

LEADER 00000nam a22000005i 4500
001 978-3-540-69446-5
003 DE-He213
005 20220119045137.0
007 cr nn 008mamaa
008 100301s2008 gw | s |||| 0|eng d
020 |a 9783540694465  |9 978-3-540-69446-5 
024 7 |a 10.1007/978-3-540-69446-5  |2 doi 
050 4 |a QA75.5-76.95 
072 7 |a UYA  |2 bicssc 
072 7 |a COM014000  |2 bisacsh 
072 7 |a UYA  |2 thema 
082 0 4 |a 004.0151  |2 23 
100 1 |a Gawiejnowicz, Stanislaw.  |e author.  |4 aut  |4 http://id.loc.gov/vocabulary/relators/aut 
245 1 0 |a Time-Dependent Scheduling  |h [electronic resource] /  |c by Stanislaw Gawiejnowicz. 
250 |a 1st ed. 2008. 
264 1 |a Berlin, Heidelberg :  |b Springer Berlin Heidelberg :  |b Imprint: Springer,  |c 2008. 
300 |a XVI, 380 p. 26 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 
490 1 |a Monographs in Theoretical Computer Science. An EATCS Series,  |x 2193-2069 
505 0 |a Fundamentals -- Preliminaries -- Problems and algorithms -- NP-complete problems -- Basics of the scheduling theory -- Basics of time-dependent scheduling -- Complexity -- Single-machine time-dependent scheduling -- Parallel-machine time-dependent scheduling -- Dedicated-machine time-dependent scheduling -- Algorithms -- Approximation and heuristic algorithms -- Greedy algorithms based on signatures -- Local search algorithms -- Advanced Topics -- Matrix methods in time-dependent scheduling -- Scheduling dependent deteriorating jobs -- Time-dependent scheduling with two criteria. 
520 |a Time-dependent scheduling involves problems in which the processing times of jobs depend on when those jobs are started. This book is a comprehensive study of complexity results and optimal and suboptimal algorithms concerning time-dependent scheduling in single-, parallel- and dedicated-machine environments. In addition to complexity issues and exact or heuristic algorithms which are typically presented in scheduling books, the author also includes more advanced topics such as matrix methods in time-dependent scheduling, and time-dependent scheduling with two criteria. The reader should be familiar with basic notions of calculus, discrete mathematics and combinatorial optimization theory, while the book offers introductory material on NP-complete problems, and the basics of scheduling theory. The author includes numerous examples, figures and tables, he presents different classes of algorithms using pseudocode, and he completes the book with an extensive bibliography, and author, symbol and subject indexes. The book is suitable for researchers working on scheduling, problem complexity, optimization, heuristics and local search algorithms. 
650 0 |a Computer science. 
650 0 |a Computer programming. 
650 0 |a Algorithms. 
650 0 |a Mathematical optimization. 
650 0 |a Artificial intelligence. 
650 0 |a Operations research. 
650 1 4 |a Theory of Computation. 
650 2 4 |a Programming Techniques. 
650 2 4 |a Algorithms. 
650 2 4 |a Optimization. 
650 2 4 |a Artificial Intelligence. 
650 2 4 |a Operations Research and Decision Theory. 
710 2 |a SpringerLink (Online service) 
773 0 |t Springer Nature eBook 
776 0 8 |i Printed edition:  |z 9783540865582 
776 0 8 |i Printed edition:  |z 9783642088933 
776 0 8 |i Printed edition:  |z 9783540694458 
830 0 |a Monographs in Theoretical Computer Science. An EATCS Series,  |x 2193-2069 
856 4 0 |u https://doi.uam.elogim.com/10.1007/978-3-540-69446-5  |z Texto Completo 
912 |a ZDB-2-SCS 
912 |a ZDB-2-SXCS 
950 |a Computer Science (SpringerNature-11645) 
950 |a Computer Science (R0) (SpringerNature-43710)