DGAP- The Dynamic Generalized Assignment Problem

Konstantin Kogan, Avraham Shtub, Vadim E. Levit

Research output: Contribution to journalArticlepeer-review

22 Scopus citations


The Generalized Assignment Problem (GAP) is a well-known operations research model. Given a set of tasks to be assigned to a group of agents and the cost of performing each task by each agent, the mode allocates tasks to agents to minimize the total cost subject to the availability of a single resource type. The single resource is consumed by the agents when performing these tasks. In this paper, we add the impact of time to the model assuming that each task has a due date, and inventory cost as well as shortage cost is incurred when a task is finished ahead or after its due date, respectively. We formulate the continuous-time optimal control mode of the problem where identical tasks are grouped into jobs (or batches), each job is performed by each agent with a fixed (production) rate, while due dates are transformed into demand. As a result, analytical properties of the optimal behavior of such a dynamic system are derived. Based on those properties, an efficient time-decomposition procedure is developed to solve the problem.

Original languageEnglish
Pages (from-to)227-239
Number of pages13
JournalAnnals of Operations Research
StatePublished - 1997
Externally publishedYes


Dive into the research topics of 'DGAP- The Dynamic Generalized Assignment Problem'. Together they form a unique fingerprint.

Cite this