Advertisement

Models and Algorithms of Time-Dependent Scheduling

  • Stanisław Gawiejnowicz
Book
  • 719 Downloads

Table of contents

  1. Front Matter
    Pages I-XXIV
  2. FUNDAMENTALS

    1. Front Matter
      Pages 1-1
    2. Stanisław Gawiejnowicz
      Pages 3-15
    3. Stanisław Gawiejnowicz
      Pages 17-34
    4. Stanisław Gawiejnowicz
      Pages 35-44
  3. SCHEDULING MODELS

    1. Front Matter
      Pages 45-45
    2. Stanisław Gawiejnowicz
      Pages 47-63
    3. Stanisław Gawiejnowicz
      Pages 65-82
    4. Stanisław Gawiejnowicz
      Pages 83-109
  4. POLYNOMIAL PROBLEMS

    1. Front Matter
      Pages 111-111
    2. Stanisław Gawiejnowicz
      Pages 113-169
    3. Stanisław Gawiejnowicz
      Pages 171-176
    4. Stanisław Gawiejnowicz
      Pages 177-195
  5. NP-HARD PROBLEMS

    1. Front Matter
      Pages 197-197
    2. Stanisław Gawiejnowicz
      Pages 199-217
    3. Stanisław Gawiejnowicz
      Pages 219-227
    4. Stanisław Gawiejnowicz
      Pages 229-236
  6. ALGORITHMS

    1. Front Matter
      Pages 237-237
    2. Stanisław Gawiejnowicz
      Pages 239-259
    3. Stanisław Gawiejnowicz
      Pages 261-278
    4. Stanisław Gawiejnowicz
      Pages 279-299
    5. Stanisław Gawiejnowicz
      Pages 301-327
    6. Stanisław Gawiejnowicz
      Pages 329-351
  7. ADVANCED TOPICS

    1. Front Matter
      Pages 353-353
    2. Stanisław Gawiejnowicz
      Pages 355-383
    3. Stanisław Gawiejnowicz
      Pages 385-430
    4. Stanisław Gawiejnowicz
      Pages 431-449
    5. Stanisław Gawiejnowicz
      Pages 451-502
  8. Back Matter
    Pages 503-538

About this book

Introduction

This is a comprehensive study of various time-dependent scheduling problems 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, time-dependent scheduling with two criteria and time-dependent two-agent scheduling. 

The reader should be familiar with the basic notions of calculus, discrete mathematics and combinatorial optimization theory, while the book offers introductory material on theory of algorithms, 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, he completes all chapters with extensive bibliographies, and he closes the book with comprehensive symbol and subject indexes. 

The previous edition of the book focused on computational complexity of time-dependent scheduling problems. In this edition, the author concentrates on models of time-dependent job processing times and algorithms for solving time-dependent scheduling problems. The book is suitable for researchers working on scheduling, problem complexity, optimization, heuristics and local search algorithms.

Keywords

Optimization Theory Algorithms Combinatorial Optimization Heuristics Scheduling Time-Dependent Scheduling

Authors and affiliations

  • Stanisław Gawiejnowicz
    • 1
  1. 1.Faculty of Mathematics and Computer ScienceAdam Mickiewicz University in PoznańPoznańPoland

Bibliographic information

  • DOI https://doi.org/10.1007/978-3-662-59362-2
  • Copyright Information Springer-Verlag GmbH Germany, part of Springer Nature 2020
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Computer Science Computer Science (R0)
  • Print ISBN 978-3-662-59361-5
  • Online ISBN 978-3-662-59362-2
  • Series Print ISSN 1431-2654
  • Series Online ISSN 2193-2069
  • Buy this book on publisher's site
Industry Sectors
Automotive
Biotechnology
Finance, Business & Banking
Electronics
IT & Software
Telecommunications
Consumer Packaged Goods
Aerospace
Engineering