Scheduling Algorithms
Besides scheduling problems for single and parallel machines and shop scheduling problems the book covers advanced models involving due-dates, sequence dependent changeover times and batching. Also multiprocessor task scheduling and problems with multipur
- PDF / 27,387,782 Bytes
- 375 Pages / 439.37 x 666.142 pts Page_size
- 9 Downloads / 214 Views
Springer-V erlag Berlin Heidelberg GmbH
Peter Brucker
Scheduling Algorithms Third Edition With 77 Figures and 32 Tables
i
Springer
Prof. Dr. Peter Brucker Universität Osnabrück Fachbereich Mathematik/Informatik Albrechtstr. 28 49076 Osnabrück Germany
Library of Congress Cataloging-in-Publication Data applied for Die Deutsche Bibliothek - CIP-Einheitsaufnahme Brucker, Peter: Scheduling Algorithms: With 22 Tables I Peter Brucker. - 3. ed. ISBN 978-3-662-04552-7 ISBN 978-3-662-04550-3 (eBook) DOI 10.1007/978-3-662-04550-3 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 permitred 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 SpringerVerlag Berlin Beideiberg GmbH. Violations are liable for prosecution under the German Copyright Law. http://www.springer.de ©Springer-Verlag Berlin Beideiberg 1995, 1998,2001 Originally published by Springer-Verlag Berlin Beideiberg New York in 2001 Softcoverreprint ofthe bardeover 3rd edition 2001 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 proteelive laws and regulations and therefore free for general use. Hardcover-Design: Erich Kirchner, Heidelberg SPIN 10793956
42/2202-5 4 3 2 I 0 - Printedon acid-free paper
Preface of the Third Edition In this edition again the complexity columns at the end of each chapter and the corresponding references have been updated. I would like to express may gratitude to Dr. Sigrid Knust for taking care of a corresponding documentation of complexity results for scheduling problems in the Internet. These pages can be found under the world-wide-web address http:/ /www.mathematik.uni-osnabrueck.de/research/OR/class. In addition to the material of the second edition some new results on scheduling problems with release times and constant processing times and on multiprocessor task problems in which each task needs a certain number of processors have been included. The new edition has been rewritten in :0'IEX2c. Many thanks go to Marianne Gausmann for the new typesetting and to Christian Strotmann for creating the bibliography database files. Osnabrück, March 2001
Peter Brucker
Preface of the Second Edition In this revised edition new material has been added. In particular, the chapters on batching problems and multiprocessor task scheduling have been augmented. Also the complexity columns at the end of each chapter have been updated. In this connection I would like thank Jan Kare! Lenstra for providing the current results of the program MSPCLASS. I am grateful for the constructive comments of Jacek Bla
