Abstract
Scheduling problems in which agents (users, customers, application masters, resource manager, etc.) have to share the same set(s) of resources are at the frontier of combinatorial optimization and cooperative game theory. This paper deals with scheduling problems arising when two agents, each with a set of nonpreemptive jobs, compete to perform their respective jobs on two common identical parallel machines. Each agent aims at minimizing a certain objective function that depends on the completion times of its jobs only. The objective functions we consider in our study are makespan and number of tardy jobs. The agents may share some jobs and this problem is called non-disjoint multi-agent scheduling problem [3]. Finding the optimal solution for one agent with a constraint on the other agent’s cost function is known to be \(\mathcal {NP}\)-hard. To obtain best compromise solutions for each agent, we propose polynomial and pseudo-polynomial heuristics. Two mixed integer linear programming models are developed to calculate exact non-dominated solutions. Experimental results are conducted to measure the solutions quality given by heuristics.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Agnetis, A., Mirchandani, P., Pacciarelli, D., Pacifici, A.: Non-dominated schedules for a job-shop with two competing users. Comput. Math. Organ. Theory 6(2), 191–217 (2000)
Agnetis, A., Mirchandani, P., Pacciarelli, D., Pacifici, A.: Scheduling problems with two competing agents. Oper. Res. 52, 229–242 (2004)
Agnetis, A., Billaut, J.-C., Gawiejnowicz, S., Pacciarelli, D., Soukhal, A.: Multiagent Scheduling Models and Algorithms. Springer, Heidelberg (2014). 271 p
Baker, K.R., Smith, J.C.: A multiple-criteria model for machine scheduling. J. Sched. 6, 7–16 (2003)
Balasubramanian, H., Fowler, J., Keha, A., Pfund, M.: Scheduling interfering job sets on parallel machines. Eur. J. Oper. Res. 199, 55–67 (2009)
Blazewicz, J., Ecker, K.H., Pesch, E., Schmidt, G., Weglarz, J.: Handbook on Scheduling: From Theory to Applications. International Handbooks on Information Systems. Springer, Heidelberg (2007)
Deb, K., Agrawal, S., Pratap, A., Meyarivan, T.: A fast and elitist multi-objective genetic algorithm: NSGA-II. IEEE Trans. Evol. Comput. 6, 182–197 (2002)
Huynh Tuong, N., Soukhal, A., Billaut, J.C.: Single-machine multi-agent scheduling problems with a global objective function. J. Sched. 15(3), 311–321 (2012)
Kung, H.T., Luccio, F., Preparata, F.P.: On finding the maxima of a set of vectors. J. Associ. Comput. Mach. 22(4), 469–476 (1975)
Ng, C.T., Cheng, T.C.E., Yuan, J.J.: A note on the complexity of the problem of two-agent scheduling on a single machine. J. Comb. Optim. 12(4), 387–394 (2006)
Peha, J.M.: Heterogeneous-criteria scheduling: minimizing weighted number of tardy jobs and weighted completion time. Comput. Oper. Res. 22(10), 1089–1100 (1995)
Sadi, F., Soukhal, A., Billaut, J.-C.: Solving multi-agent scheduling problems on parallel machines with a global objective function. RAIRO - Oper. Res. 48(2), 225–269 (2014)
Acknowledgments
This research was partially funded by the European Union through the Erasmus STA program.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer International Publishing AG
About this paper
Cite this paper
Sadi, F., Van Ut, T., Tuong, N.H., Soukhal, A. (2016). Non-disjoint Multi-agent Scheduling Problem on Identical Parallel Processors. In: Dang, T., Wagner, R., Küng, J., Thoai, N., Takizawa, M., Neuhold, E. (eds) Future Data and Security Engineering. FDSE 2016. Lecture Notes in Computer Science(), vol 10018. Springer, Cham. https://doi.org/10.1007/978-3-319-48057-2_28
Download citation
DOI: https://doi.org/10.1007/978-3-319-48057-2_28
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-48056-5
Online ISBN: 978-3-319-48057-2
eBook Packages: Computer ScienceComputer Science (R0)