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
- PDF / 5,265,327 Bytes
- 379 Pages / 441 x 666 pts Page_size
- 20 Downloads / 213 Views
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, reproduction on microfilm or in any other way, and storage in data banks. Duplication of this publication or parts thereof is permitted only under the provisions of the German Copyright Law of September 9, 1965, in its current version, and permission for use must always be obtained from Springer. Violations are liable to prosecution under the German Copyright Law. The use of general descriptive names, registered names, trademarks, etc. in this publication does not imply, even in the absence of a specific statement, that such names are exempt from the relevant protective laws and regulations and therefore free for general use. Cover Design: K¨unkelLopka GmbH, Heidelberg Printed on acid-free paper 987654321 springer.com
To my parents
Preface
T
he book presented to the reader is devoted to time-dependent scheduling. Scheduling 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 find, 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-fifties of the twentieth cen
Data Loading...
