High Speed Heuristics for Real-Time Personnel Assignment Models

Abstract

This document presents a new network based model (called the cloning model) for the problem of on-line personnel assignment. In computer simulation tests, we found that the specialized software designed to solve the cloning model will obtain optimal solutions in about four seconds on a 486 PC running at 50 Mhz. This demonstrates that this model can be used for on-line applications of personnel assignment which involve telephone negotiation. In addition, this document presents new algorithms for a variety of optimization models including (1) the singly constrained assignment problem, (2) the separable convex cost network flow problem, (3) the minimum cost network flow problem, and (4) the problem of identifying the extreme points of the convex hull of a given set of points.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Jan 26, 1994
Accession Number
ADA276908

Entities

People

  • Jeffery L. Kennington
  • Richard V. Helgason

Organizations

  • Southern Methodist University

Tags

Communities of Interest

  • Energy and Power Technologies
  • Human Systems
  • Materials and Manufacturing Processes

DTIC Thesaurus Topics

  • Algorithms
  • Computer Programming
  • Computer Science
  • Computers
  • Enlisted Personnel
  • Evolutionary Algorithms
  • Flow Network
  • Heuristic Methods
  • Integer Programming
  • Linear Programming
  • Mathematical Models
  • Mathematical Programming
  • Operations Research
  • Optimization
  • Plastic Explosives
  • Pressurized Water Reactors
  • Simplex Method

Fields of Study

  • Computer science

Readers

  • Clinical Trial Research.
  • Operations Research