Scheduling two agent task chains with a central selection mechanism
- 219 Downloads
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 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 the 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.
KeywordsScheduling Multi-agent optimization Bicriteria optimization Best response Computational complexity
This work was supported by the Austrian Science Fund (FWF): [P 23829-N13] and by the Italian Ministry MIUR Project PRIN 2009XN4ZRR_002.
- Agnetis, A., Nicosia, G., Pacifici, A., & Pferschy, U. (2013). Two agents competing for a shared machine. In Proceedings of the 3rd international conference on algorithmic decision theory (ADT 2013), Lecture notes in computer science 8176, pp. 1–14, Springer: Berlin.Google Scholar
- Agnetis, A., Pacciarelli, D., & Pacifici, A. (2007). Combinatorial models for multi-agent scheduling problems, in multiprocessor scheduling: Theory and applications. Vienna, Austria: I-Tech Education and Publishing.Google Scholar
- Arbib, C., Smriglio, S., & Servilio, M. (2004). A competitive scheduling problem and its relevance to UMTS channel assignment. Networks, 44(2), 132–141.Google Scholar
- Ding, G., & Sun, S. (2010). Single-machine scheduling problems with two agents competing for makespan (pp. 244–255). Lecture notes in computer science, 6328, Berlin: Springer.Google Scholar
- Huynh, Tuong N., Soukhal, A., & Billaut, J.-C. (2012). Single-machine multi-agent scheduling problems with a global objective function. Journal of Scheduling, 15(1), 311–321.Google Scholar
- Jayasudha, A. R., & Purusothaman, T. (2012). Job scheduling model with job sequencing and prioritizing strategy in grid computing. International Journal of Computer Applications, 46(24), 29–32.Google Scholar
- Nicosia, G., Pacifici, A., & Pferschy, U. (2009). Subset weight maximization with two competing agents. In Proceedings of algorithmic decision theory: ADT 2009, Lecture notes in computer science 5783, pp. 74–85, Berlin: Springer.Google Scholar
- Nicosia, G., Pacifici, A., & Pferschy, U. (2014). Scheduling the tasks of two agents with a central selection mechanism, submitted. available as: Optimization Online 2014–02-4222.Google Scholar
- Soomer, M. J., & Franx, G. J. (2008). Scheduling aircraft landings using airlines’ preferences. Mathematical Programming, 190, 277–291.Google Scholar
- T’Kindt, V., & Billaut, J.-C. (2006). Multicriteria scheduling. Theory, models and algorithms. Berlin: Springer.Google Scholar
- Ye, D., & Zhang, G. (2012). Coordination mechanisms for selfish parallel jobs scheduling. In M. Agrawal, et al. (Eds.), 9th Annual conference on theory and applications of models of computation, 2012 (pp. 225–236). Lecture notes in computer science 7287. Berlin:Springer.Google Scholar