Strategies in competing subset selection

Marini, Claudia; Nicosia, Gaia; Pacifici, Andrea; Pferschy, Ulrich

doi:10.1007/s10479-011-1057-2

Cited by 12 publications

(8 citation statements)

References 14 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…This twofold approach has also been adopted in [3,4,11,12]. In particular, in [3] the authors introduce a class of multi-agent scheduling problems in which the decision process is organized in rounds and provide some preliminary results for different shop configurations.…”

Section: Introductionmentioning

confidence: 99%

Two agent scheduling with a central selection mechanism

Nicosia

Pacifici

Pferschy

2015

Theoretical Computer Science

Self Cite

View full text Add to dashboard Cite

Please cite this article in press as: G. Nicosia et al., Two agent scheduling with a central selection mechanism, Theoret. Comput. Sci. (2015), http://dx. AbstractWe address a class of deterministic scheduling problems in which two agents compete for the usage of a single machine. The agents have their own objective functions and submit in each round an arbitrary, unprocessed task from their buffer for possible selection. In each round the shorter of the two submitted tasks is chosen and processed on the machine.We consider the problems under two distinct perspectives: First, we look at them from a centralized point of view as bicriteria optimization problems and try to characterize the set of Pareto optimal solutions. Then, the problems are viewed under the perspective of a single agent. In particular, we measure the worst-case performance of classical priority rules compared to an optimal strategy. Finally, we consider minimax strategies, i.e. algorithms optimizing the objective of one agent in the worst case.

show abstract

Section: Introductionmentioning

confidence: 99%

Two agent scheduling with a central selection mechanism

Nicosia

Pacifici

Pferschy

2015

Theoretical Computer Science

Self Cite

View full text Add to dashboard Cite

show abstract

“…They designed a Pareto-efficient solution set and used the Shapley value method to evaluate the job sequence of two agents by comparing the net profit and opportunity. Marini et al 16 developed preventive or minimax strategies and best-response strategies to solve the scheduling problem of two agents competing to add items to a solution set. Ye and Zhang 17 designed and analyzed coordination mechanisms for machines and considered the class of policies based on the bottom-left and shelf-packing algorithms.…”

Section: Literature Reviewmentioning

confidence: 99%

A multi-agent scheduling problem for two identical parallel machines to minimize total tardiness time and makespan

Wen

2018

Advances in Mechanical Engineering

View full text Add to dashboard Cite

We study an agent-based scheduling problem of two identical parallel machines:. The machines and tasks are regarded as agents. A new multi-agent scheduling model is proposed to achieve the optimum from the two task agents, agent A and agent B. The objective is divided into two classes. The objectives of agent A and agent B are to minimize the total tardiness time and minimize the makespan, respectively. In this article, we research two identical parallel machines in which one job category can be processed by one machine agent only or two machine agents and propose a new multi-agent model for two identical parallel machines, divided into two subsystems. For subsystem 1, the shortest processing time order is used to solve job priorities. A single distribution strategy is proposed to assign jobs to machine agents and is applied to the dynamic scheduling environment. For subsystem 2, a centralized distribution strategy is applied to the static scheduling environment. The proposed model performs more efficiently and is better able to handle complex and dynamic scheduling environments.

show abstract

“…• Single-agent perspective Considering an agent (say, B), its strategy consists in deciding which task to submit at each round, taking into account its own objective function. As in Ding and Sun (2010), Marini et al (2013), Nicosia et al (2009), Nicosia et al (2011, we consider two different settings concerning the information available to agent B:…”

Section: J Schedmentioning

confidence: 99%

Scheduling two agent task chains with a central selection mechanism

Agnetis

Nicosia

Pacifici

et al. 2015

J Sched

Self Cite

View full text Add to dashboard Cite

In this paper, we address a deterministic scheduling problem in which two agents compete for the usage of a single machine. Each agent decides on a fixed order to submit its tasks to an external coordination subject, who sequences them according to a known priority rule. We consider the\ud problem from different perspectives. First, we characterize the set of Pareto-optimal schedules in terms of size and computational complexity.We then address the problem from the single-agent point-of-view, that is, we consider the problem of deciding how to submit one agent’s tasks only taking into account its own objective function against the other agent, the opponent. In this regard, we consider two different settings depending on the information available to the agents: In one setting, the considered agent knows in advance all information about the submission sequence of he opponent; and in the second setting (as in minimax strategies in game theory), the agent has no information on the opponent strategy and wants to devise a strategy that minimizes its solution cost in the worst possible case. Finally, we assess the performance of some classical single-agent sequencing rules in the two-agent setting

show abstract

Strategies in competing subset selection

Cited by 12 publications

References 14 publications

Two agent scheduling with a central selection mechanism

Two agent scheduling with a central selection mechanism

A multi-agent scheduling problem for two identical parallel machines to minimize total tardiness time and makespan

Scheduling two agent task chains with a central selection mechanism

Contact Info

Product

Resources

About