Algorithms of distributed task allocation for cooperative agents
type: Item
instance of: scholarly article
title: Algorithms of distributed task allocation for cooperative agents
zbMATH Open document ID: 0944.68005
DOI: 10.1016/S0304-3975(98)00175-3
author: Sarit Kraus
author: T. Plotkin
published in: Theoretical Computer Science
publication date: 2000-08-21T00:00:00Z
Mathematics Subject Classification ID: 68M20
Mathematics Subject Classification ID: 68T99
zbMATH DE Number: 1493348
zbMATH Keywords: task allocation
zbMATH Keywords: multiagents
zbMATH Keywords: queueing networks
describes a project that uses: PDAC
MaRDI profile type: Publication
cites work: Open, Closed, and Mixed Networks of Queues with Different Classes of Customers
cites work: An efficient algorithm for a task allocation problem
cites work: A note on waiting times in systems with queues in parallel
cites work: Scheduling subject to resource constraints: Classification and complexity
cites work: Computational aspects of aggregation in multiple class queueing networks
cites work: Computational algorithms for closed queueing networks with exponential servers
cites work: Models for Dynamic Load Balancing in a Heterogeneous Multiple Processor System
cites work: Q4131987
cites work: The autostrada queueing problem
cites work: Symmetry property of the throughput in closed tandem queueing networks with finite buffers
cites work: Invariance Properties Of Queueing Networks And Their Application To Computer/Communications Systems
cites work: Q3994728
cites work: Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
cites work: Q3806522
cites work: Collaborative plans for complex group action
cites work: PDAC: A data parallel algorithm for the performance analysis of closed queueing networks
cites work: Two Similar Queues in Parallel
cites work: Multiagent negotiation under time constraints
cites work: Characteristics of optimal workload allocation for closed queueing networks
cites work: Bounding the mean response time of the minimum expected delay routing policy: an algorithmic approach
cites work: Optimality of the round-robin routing policy
cites work: Optimal Selection of CPU Speed, Device Capacities, and File Assignments
cites work: Q4841579
cites work: Queuing Network Models with State-Dependent Routing
cites work: Q3958241
cites work: Optimality of the shortest line discipline
cites work: A numerically stable algorithm for two server queue models
description: scientific article; zbMATH DE number 1493348