High Speed Heuristics for Real-Time Personnel Assignment Models
Final rept. Dec 1991-Dec 1993
SOUTHERN METHODIST UNIV DALLAS TX DEPT OF COMPUTER SCIENCE AND ENGINEERING
Pagination or Media Count:
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.
- Personnel Management and Labor Relations
- Computer Programming and Software