Coordination Mechanisms for Selfish Parallel Jobs Scheduling

Ye, Deshi; Zhang, Guochuan

doi:10.1007/978-3-642-29952-0_25

Cited by 5 publications

(3 citation statements)

References 32 publications

(39 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Similar circumstances also occur in telecommunication systems, where a capacity planner must schedule a channel to two or more users in order to maximize their on-time traffic (Arbib et al 2004). Additionally, the design and analysis of coordination mechanisms for machines, which aim to minimize the so-called price of anarchy, have been addressed in Ye and Zhang (2012).…”

Section: J Schedmentioning

confidence: 97%

Scheduling two agent task chains with a central selection mechanism

Agnetis

Nicosia

Pacifici

et al. 2015

J Sched

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

Section: J Schedmentioning

confidence: 97%

Scheduling two agent task chains with a central selection mechanism

Agnetis

Nicosia

Pacifici

et al. 2015

J Sched

View full text Add to dashboard Cite

show abstract

“…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. Mashayekhy et al 18 considered a reward-based multi-agent scheduling problem for periodic tasks.…”

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

“…Marini et al 16 develop preventive or minimax strategies, best-response strategies to solve the scheduling problem of two agents competing to add items in a solution set. Ye and Zhang 17 design and analyze coordination mechanisms for machines and consider the class of policies based on the Bottom-Left and the Shelf-Packing algorithms. Mashayekhy et al 18 research the reward-based multi-agent scheduling problem of periodic tasks.…”

Section: Literature Reviewmentioning

confidence: 99%

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

Yu¹,

Wen²,

Sangbong³

2017

Advances in Mechanical Engineering

View full text Add to dashboard Cite

We study a base-agent scheduling problem of two identical parallel machines: P2jCoj P T A , C B max . The machines and tasks are regarded as agents. A new multi-agent scheduling model is proposed in order to achieve the optimum of task agents, which contains two agents: agent A and agent B. The objective is divided into two classes. The objective of agent A and agent B is to minimize total tardiness time and minimize makespan, respectively. In this article, we research character of two identical parallel machines that one category job can be processed by one machine agent only or two machine agents and propose a new multi-agent model on two identical parallel machines, divided into two subsystems. For subsystem 1, it is applied by a dynamic scheduling environment. Shortest processed time order is proposed to solve jobs' priorities. Single distribution strategy is proposed to solve assignment of jobs to machine agents. For subsystem 2, centralized distribution strategy applied to a static scheduling environment is addressed. The new model performs more efficiently and owns a stronger ability to deal with complex and dynamic scheduling environments.

show abstract

Coordination Mechanisms for Selfish Parallel Jobs Scheduling

Cited by 5 publications

References 32 publications

Scheduling two agent task chains with a central selection mechanism

Scheduling two agent task chains with a central selection mechanism

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

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

Contact Info

Product

Resources

About