hebookpresentedtothereaderisdevotedtotime-dependentscheduling. TScheduling problems, in general, consist in the allocation of resources over time in order to perform a set of jobs. Any allocation that meets all requirements concerning the jobs and resources is called a feasible schedule. The quality of a schedule is measured by a criterion function. The aim of scheduling is to ?nd, among all feasible schedules, a schedule that optimizes the criterion function. A solution to an arbitrary scheduling problem consists in giving a polynomial-time algorithm generating either an optimal schedule or a schedule that is close to the optimal one, if the given scheduling problem has been proved to be computationally intractable. The scheduling problems are subject of interest of the scheduling theory, originated in mid-?fties of the twentieth century. The theory has been developing dynamically and new research areas constantly come into existence. The subject of this book, ti- dependent scheduling, is one of such areas. In time-dependent scheduling, the processing time of a job is variable and depends on the starting time of the job. This crucial assumption allows us to apply the scheduling theory to a broader spectrum of problems. For example, in the framework of the time-dependent scheduling theory we may consider the problems of repayment of multiple loans, ?re ?ghting and maintenance assignments. In this book, we will discuss algorithms and complexity issues concerning various time-dependent scheduling problems.
Monographs in Theoretical Computer Science An EATCS Series Editors: W. Brauer J. Hromkoviˇc G. Rozenberg A. Salomaa On behalf of the European Association for Theoretical Computer Science (EATCS) Advisory Board: G. Ausiello M. Broy C.S. Calude A. Condon D. Harel J. Hartmanis T. Henzinger T. Leighton M. Nivat C. Papadimitriou D. Scott Stanisław Gawiejnowicz Time-Dependent Scheduling with 26 Figures and 48 Tables Author Dr. Stanisław Gawiejnowicz Adam Mickiewicz University Faculty of Mathematics and Computer Science ul. Umultowska 87 61-614 Pozna´n Poland
[email protected] Series Editors Prof. Dr. Wilfried Brauer Institut f¨ur Informatik der TUM Boltzmannstr. 3 85748 Garching, Germany
[email protected] Prof. Dr. Grzegorz Rozenberg Leiden Institute of Advanced Computer Science University of Leiden Niels Bohrweg 1 2333 CA Leiden, The Netherlands
[email protected] ISBN 978-3-540-69445-8 Prof. Dr. Juraj Hromkoviˇc ETH Zentrum Department of Computer Science Swiss Federal Institute of Technology 8092 Z¨urich, Switzerland
[email protected] Prof. Dr. Arto Salomaa Turku Centre of Computer Science Lemmink¨aisenkatu 14 A 20520 Turku, Finland
[email protected] e-ISBN 978-3-540-69446-5 Monographs in Theoretical Computer Science. An EATCS Series. ISSN 1431-2654 Library of Congress Control Number: 2008932588 ACM Computing Classification (1998): F.2, I.2 c 2008 Springer-Verlag Berlin Heidelberg This work is subject to copyright. All rights are reserved, whether the whole or part of the material is concerned, specifically the rights of translation, reprinting, reuse of illustrations, recitation, broadcasting, reproduct