A Note on the Bounded Interval Generalized Assignment Problem.

Abstract

The bounded interval generalized assignment problem is exemplified by the problem of assigning tasks to agents so that each task is assigned to exactly one agent and the time required to complete the set of tasks assigned to any one agent falls between prespecified lower and upper bounds. This note describes an efficient algorithm for solving this problem. (Author)

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Jul 01, 1976
Accession Number
ADA031386

Entities

People

  • Andris A. Zoltners
  • G. Terry Ross
  • Richard M. Soland

Organizations

  • University of Texas at Austin

Tags

Communities of Interest

  • Ground and Sea Platforms
  • Materials and Manufacturing Processes

DTIC Thesaurus Topics

  • Abstracts
  • Algorithms
  • Computer Networks
  • Computer Programming
  • Computers
  • Efficiency
  • Intervals
  • Linear Programming
  • Massachusetts
  • Military Research
  • Software Development
  • United States
  • Universities

Fields of Study

  • Computer science

Readers

  • Agent-Based Social Robotics and Mobile-Assisted Learning in Virtual Environments.
  • Joint Military Operations and Doctrine.
  • Mathematical Modeling and Probability Theory.