Book
Non-disjoint Multi-agent Scheduling Problem on Identical Parallel Processors
| العنوان: | Non-disjoint Multi-agent Scheduling Problem on Identical Parallel Processors |
|---|---|
| المؤلفون: | Sadi, F, Tran, van Ut, Huynh Tuong, N, Soukhal, Ameur |
| المساهمون: | Laboratoire d'Informatique Fondamentale et Appliquée de Tours (LIFAT), Université de Tours (UT)-Institut National des Sciences Appliquées - Centre Val de Loire (INSA CVL), Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Centre National de la Recherche Scientifique (CNRS), Can Tho University of Technology (CTUT), Ho Chi Minh City University of Technology Vietnam National University, HCM (HCMUT), Vietnam National University, Ho Chi Minh City / Đại học Quốc gia TP. Hồ Chí Minh (VNU-HCM), Tran Khanh Dang, Roland Wagner, Josef Küng, Nam Thoai, Makoto Takizawa, Erich Neuhold |
| المصدر: | Future Data and Security Engineering ; https://hal.science/hal-01549320 ; Tran Khanh Dang, Roland Wagner, Josef Küng, Nam Thoai, Makoto Takizawa, Erich Neuhold. Future Data and Security Engineering, 10018, Springer, pp.400-414, 2016, Lecture Notes in Computer Science, 978-3-319-48057-2. ⟨10.1007/978-3-319-48057-2_28⟩ ; https://link.springer.com/book/10.1007/978-3-319-48057-2 |
| بيانات النشر: | HAL CCSD Springer |
| سنة النشر: | 2016 |
| المجموعة: | Université François-Rabelais de Tours: HAL |
| مصطلحات موضوعية: | Multicriteria optimization, Multiagent scheduling, parallel processors, heuristics, Dynamic programming, linear mathematical programming, [INFO.INFO-CC]Computer Science [cs]/Computational Complexity [cs.CC], [INFO.INFO-MA]Computer Science [cs]/Multiagent Systems [cs.MA], [INFO.INFO-RO]Computer Science [cs]/Operations Research [math.OC] |
| الوصف: | International audience ; 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 N P-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. |
| نوع الوثيقة: | book part |
| اللغة: | English |
| ردمك: | 978-3-319-48057-2 3-319-48057-X |
| Relation: | hal-01549320; https://hal.science/hal-01549320; https://hal.science/hal-01549320/document; https://hal.science/hal-01549320/file/FDSE2016_Paper_103_SadietAl.pdf |
| DOI: | 10.1007/978-3-319-48057-2_28 |
| الاتاحة: | https://hal.science/hal-01549320 https://hal.science/hal-01549320/document https://hal.science/hal-01549320/file/FDSE2016_Paper_103_SadietAl.pdf https://doi.org/10.1007/978-3-319-48057-2_28 |
| Rights: | info:eu-repo/semantics/OpenAccess |
| رقم الانضمام: | edsbas.E16BA74F |
| قاعدة البيانات: | BASE |
| ردمك: | 9783319480572 331948057X |
|---|---|
| DOI: | 10.1007/978-3-319-48057-2_28 |