Multiagent Scheduling - Models and Algorithms
Multiagent Scheduling - Models and Algorithms
复制标题
DOI：
10.1007/978-3-642-41880-8
复制
发表时间：
2014-01
期刊：
影响因子：
--
通讯作者：
A. Agnetis;J. Billaut;Stanisław Gawiejnowicz;D. Pacciarelli;A. Soukhal
中科院分区：
文献类型：
--
作者：
A. Agnetis;J. Billaut;Stanisław Gawiejnowicz;D. Pacciarelli;A. Soukhal
调度问题是组合优化问题，其中一些活动必须使用它们所需的资源来执行。随着时间的推移，资源在活动中的可行分配称为进度计划。进度计划的质量是通过各种最优性标准来衡量的，这些标准是活动完成时间和已使用资源量的函数。在建设中的问题，不同类别的时间表所需的属性被认为是起源于大约60年前的调度理论。调度理论是一个非常活跃的研究领域，包含了大量的调度模型。有几本书（例如，Blazewicz et al. 2007; Brucker 2007或Pinedo 2008）提出了调度问题的经典模型，其中所有数据都用数字描述，并且通过单一的最优性标准来评估调度。其他一些书提出了更具体的模型，如在准时制制造系统中的调度问题（Jozefowska 2007），调度问题时，调度的质量是由几个最优性标准衡量（T 'Kindt和Billaut 2006）或调度问题，其中作业处理时间取决于作业何时开始（Gawiejnowicz 2008）。这本书介绍给读者是致力于多代理调度。关于这种调度模型的研究大约在10年前开始，在Baker和Smith（2003）和Agnetis等人发表之后。（2004），其中引入了两代理调度。在多智能体调度问题中，活动共享资源，但由两个或多个使用自己的最优性标准的智能体维护。这些代理可能会或可能不会竞争，最终的时间表是由几个最优性标准进行评估。虽然多智能体调度在许多应用中得到了深入的研究，但它并没有在以前的专著中提出。本书分为六章，可分为两个部分。本书的第一部分，即导言部分由两章组成。第一章介绍了多Agent调度的一般概念和表示法，多目标问题的几种求解方法，以及考虑多Agent时的不同情况。第二章回顾了复杂性理论的基本要素和解决方法。具有性能的算法VII
Scheduling problems are combinatorial optimization problems in which some activities have to be executed using resources that they need. A feasible allocation of the resources to the activities over time is called a schedule. The quality of a schedule is measured by various optimality criteria that are functions of completion times of the activities and the amounts of resources that have been used. Problems in the construction of different classes of schedules with required properties are considered in the theory of scheduling that originated approximately 60 years ago. The theory of scheduling is a very active research area containing a great number of scheduling models. Several books (see, eg, Blazewicz et al. 2007; Brucker 2007 or Pinedo 2008) present classical models of scheduling problems in which all data are described by numbers, and schedules are evaluated by a single optimality criterion. Some other books present more specific models such as scheduling problems in just-in-time manufacturing systems (Jozefowska 2007), scheduling problems when the quality of a schedule is measured by several optimality criteria (T’Kindt and Billaut 2006) or scheduling problems in which job processing times depend on when the jobs are started (Gawiejnowicz 2008). The book presented to the reader is devoted to multiagent scheduling. Research on this scheduling model was started approximately 10 years ago, after publication of Baker and Smith (2003) and Agnetis et al.(2004), in which two-agent scheduling was introduced. In multiagent scheduling problems, activities share resources but are maintained by two or more agents that use their own optimality criteria. These agents may or may not compete, and the final schedule is evaluated by several optimality criteria. Though multiagent scheduling is intensively studied in view of many applications, it was not presented earlier in a monograph. This book is organized into six chapters that can be divided into two parts. The first, introductory part of the book is composed of two chapters. Chapter 1 gives a general introduction to multiagent scheduling, introducing general definitions and notation, several resolution approaches for multicriteria problems and different scenario when considering several agents. Chapter 2 recalls basic elements of complexity theory and resolution methods. Algorithms with performance vii