Competitive multi-agent scheduling with an iterative selection rule
نویسندگان
چکیده
منابع مشابه
Multi Machine Scheduling: An Agent-Based Approach
Scheduling of multiple parallel machines in the face of sequence dependent setups and downstream considerations is a hard problem. No single efficient algorithm is guaranteed to produce optimal results. We describe a solution for an instance of this problem, in the domain of paper manufacturing. The problem has additional job machine restrictions and fixed costs of assigning jobs to machines. W...
متن کاملOptimal Multi-Agent Scheduling with Constraint Programming
We consider the problem of computing optimal schedules in multi-agent systems. In these problems, actions of one agent can influence the actions of other agents, while the objective is to maximize the total ‘quality’ of the schedule. More specifically, we focus on multiagent scheduling problems with time windows, hard and soft precedence relations, and a nonlinear objective function. We show ho...
متن کاملMulti-agent single machine scheduling
We consider the scheduling problems arising when several agents, each owning a set of nonpreemptive jobs, compete to perform their respective jobs on one shared processing resource. Each agent wants to minimize a certain cost function, which depends on the completion times of its jobs only. The cost functions we consider in this paper are maximum of regular functions (associated with each job),...
متن کاملMulti-agent-based agile scheduling
The multi-agent systems paradigm represents one of the most promising approaches to the development of agile scheduling systems in manufacturing. Innovative and balanced perspectives of multi-agent approaches to agile scheduling are discussed in this paper, and several achieved results and current developments are described. The description of the multi-agent framework emphasizes the use of neg...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: 4OR
سال: 2017
ISSN: 1619-4500,1614-2411
DOI: 10.1007/s10288-017-0341-7