Title

Applying The Comsoal Computer Heuristic To The Constrained Resource Allocation Problem

Abstract

Generating a project schedule that meets all activity precedence constraints while minimizing the overall project duration is often difficult. The complex project-scheduling problem is further complicated by the real-world constraint that often a limited number of resources must be allocated to competing activities. This paper investigates the application of the computer method COMSOAL to this resource allocation problem. COMSOAL (Computer Method of Sequencing Operations for Assembly Lines), originally a solution approach for the assembly line balancing problem, is a computer heuristic that can be used to generate a feasible solution to the resource allocation problem at each iteration of the heuristic. A solution methodology of repeatedly running COMSOAL will result in many feasible solutions from which the best is chosen. This solution approach now becomes viable given the increased speed of inexpensive computers. This paper discusses the adaptation of the COMSOAL approach to the resource allocation problem as well as a designed experiment used to investigate the appropriateness of COMSOAL for a known set of resource allocation test problems. Results from this experiment show COMSOAL is a viable method to solve these resource allocation problems when compared to the results from several well-known resource allocation algorithms and to the optimal solutions.

Publication Date

1-1-2000

Publication Title

Computers and Industrial Engineering

Volume

38

Issue

3

Number of Pages

413-422

Document Type

Article

Personal Identifier

scopus

DOI Link

https://doi.org/10.1016/S0360-8352(00)00053-X

Socpus ID

0034296450 (Scopus)

Source API URL

https://api.elsevier.com/content/abstract/scopus_id/0034296450

This document is currently not available here.

Share

COinS