CiNii Books - Time-dependent scheduling

Author(s)

- Gawiejnowicz, Stanislaw

Bibliographic Information

Time-dependent scheduling

Stanislaw Gawiejnowicz

（Monographs in theoretical computer science : an EATCS series）

Springer, c2008

Available at / 10 libraries

愛知工業大学附属図書館図

336.6||G003647245

OPAC
Kansai University Library図

210682540

OPAC
Science and Technology Library of Gunma University図書館

007.64:G28200900302

OPAC
Kobe University Library for Science and Technology

548-84-907030200802827

OPAC
INTERNATIONAL CHRISTIAN UNIVERSITY LIBRARY図

007.64/G28t06818919

OPAC
摂南大学図書館本館

007.64||G20902247

OPAC
The University of Electro-Communications Library開架

548.96/G282008103592

OPAC
東京電機大学総合メディアセンター鳩山センター

548/G-286008001930

OPAC
Kyoto University Library

007.64||G 28

OPAC
広島大学図書館東図書館

007.64:G-286000418741

OPAC
No Libraries matched.
Remove all filters.

Search this Book/Journal

Note

Includes bibliographical references and index

Description and Table of Contents

Description

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.

Table of Contents

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.

by "Nielsen BookData"