|
|
|
|
| LEADER |
03027nmm a2200385 u 4500 |
| 001 |
EB000377991 |
| 003 |
EBX01000000000000000231043 |
| 005 |
00000000000000.0 |
| 007 |
cr||||||||||||||||||||| |
| 008 |
130626 ||| eng |
| 020 |
|
|
|a 9783540694465
|
| 100 |
1 |
|
|a Gawiejnowicz, Stanislaw
|
| 245 |
0 |
0 |
|a Time-Dependent Scheduling
|h Elektronische Ressource
|c by Stanislaw Gawiejnowicz
|
| 250 |
|
|
|a 1st ed. 2008
|
| 260 |
|
|
|a Berlin, Heidelberg
|b Springer Berlin Heidelberg
|c 2008, 2008
|
| 300 |
|
|
|a XVI, 380 p. 26 illus
|b online resource
|
| 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
|
| 653 |
|
|
|a Operations research
|
| 653 |
|
|
|a Optimization
|
| 653 |
|
|
|a Programming Techniques
|
| 653 |
|
|
|a Computer science
|
| 653 |
|
|
|a Computer programming
|
| 653 |
|
|
|a Artificial Intelligence
|
| 653 |
|
|
|a Algorithms
|
| 653 |
|
|
|a Artificial intelligence
|
| 653 |
|
|
|a Theory of Computation
|
| 653 |
|
|
|a Mathematical optimization
|
| 653 |
|
|
|a Operations Research and Decision Theory
|
| 041 |
0 |
7 |
|a eng
|2 ISO 639-2
|
| 989 |
|
|
|b Springer
|a Springer eBooks 2005-
|
| 490 |
0 |
|
|a Monographs in Theoretical Computer Science. An EATCS Series
|
| 028 |
5 |
0 |
|a 10.1007/978-3-540-69446-5
|
| 856 |
4 |
0 |
|u https://doi.org/10.1007/978-3-540-69446-5?nosfx=y
|x Verlag
|3 Volltext
|
| 082 |
0 |
|
|a 004.0151
|
| 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
|