Multiagent Scheduling Models and Algorithms
Scheduling theory has received a growing interest since its origins in the second half of the 20th century. Developed initially for the study of scheduling problems with a single objective, the theory has been recently extended to problems involving multi
- PDF / 4,643,358 Bytes
- 281 Pages / 439.43 x 683.15 pts Page_size
- 9 Downloads / 314 Views
Multiagent Scheduling Models and Algorithms
Multiagent Scheduling
Alessandro Agnetis • Jean-Charles Billaut • Stanisław Gawiejnowicz • Dario Pacciarelli • Ameur Soukhal
Multiagent Scheduling Models and Algorithms
123
Alessandro Agnetis Dipartimento di Ingegneria dell’Informazione e Scienze Matematiche UniversitJa di Siena Siena, Italy
Jean-Charles Billaut Ameur Soukhal Laboratoire d’Informatique Université François Rabelais Tours Tours, France
Stanisław Gawiejnowicz Faculty of Mathematics and Computer Science Adam Mickiewicz University Pozna´n, Poland
Dario Pacciarelli Dipartimento di Ingegneria UniversitJa Roma Tre Roma, Italy
ISBN 978-3-642-41879-2 ISBN 978-3-642-41880-8 (eBook) DOI 10.1007/978-3-642-41880-8 Springer Heidelberg New York Dordrecht London Library of Congress Control Number: 2014930231 © Springer-Verlag Berlin Heidelberg 2014 This work is subject to copyright. All rights are reserved by the Publisher, whether the whole or part of the material is concerned, specifically the rights of translation, reprinting, reuse of illustrations, recitation, broadcasting, reproduction on microfilms or in any other physical way, and transmission or information storage and retrieval, electronic adaptation, computer software, or by similar or dissimilar methodology now known or hereafter developed. Exempted from this legal reservation are brief excerpts in connection with reviews or scholarly analysis or material supplied specifically for the purpose of being entered and executed on a computer system, for exclusive use by the purchaser of the work. Duplication of this publication or parts thereof is permitted only under the provisions of the Copyright Law of the Publisher’s location, in its current version, and permission for use must always be obtained from Springer. Permissions for use may be obtained through RightsLink at the Copyright Clearance Center. Violations are liable to prosecution under the respective Copyright Law. The use of general descriptive names, registered names, trademarks, service marks, 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. While the advice and information in this book are believed to be true and accurate at the date of publication, neither the authors nor the editors nor the publisher can accept any legal responsibility for any errors or omissions that may be made. The publisher makes no warranty, express or implied, with respect to the material contained herein. Printed on acid-free paper Springer is part of Springer Science+Business Media (www.springer.com)
To Silvia, Walter and Gaia Alessandro Agnetis To my parents Jean-Charles Billaut To Mirosława and Agnieszka Stanisław Gawiejnowicz To my parents Dario Pacciarelli To my parents Ameur Soukhal
Preface
Scheduling problems are combinatorial optimization problems in which some activities have to be executed using resources that they need. A feasible allocation of the res
Data Loading...
