Reducing Multivalued Discrete Variables in Solving Separable Task Assignment Problems

In this paper, we introduce the separable task assignment problem (STAP) in which n separable tasks are assigned to m agents subject to agents’ capacity constraints. The objective is to minimize the costs that occur during the manufacturing and the communication between agents. A task is separable i...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	Journal of the Operations Research Society of China (Internet) Ročník 4; číslo 1; s. 97 - 110
Hlavní autori:	Gai, Ling, Jin, Qing-Wei, Tian, Yuan, Huang, Yao-Huei
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Beijing Operations Research Society of China 01.03.2016 Springer Nature B.V
Predmet:	Algorithms Assignment problem Communication Continuity (mathematics) Costs Management Science Manufacturing Mathematical programming Mathematics Mathematics and Statistics Operations Research Variables Task-assignment problem 90C10 90B80 Ternary variables Binary variables Mixed integer programming problem
ISSN:	2194-668X, 2194-6698
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!