Engineering Commons^™

Development And Testing Of A Heuristic Line Balancing Program For A Microcomputer, Dean B. Creech

Retrospective Theses and Dissertations

Development, operation, and testing of a heuristic line balancing program for a microcomputer are discussed. Tasks are grouped into work stations along an assembly line such that the number of work stations required is minimized.

The model is built primarily using the Hoffman (1963) procedure with modifications described by Gehrlein and Patterson (1975). For purposes of comparison the Rank Positional Weight technique (Helgeson and Birnie, 1961) is also included in the model.

Testing included thirty-seven different balances using problems from the literature. For each balance, both Rank Positional Weight and Hoffmann solutions were obtained in the forward and reverse directions. …

Project Network Scheduling With Limited Resources Using Heuristic Solution Techniques, Enrique J. Daboin Rojas

Retrospective Theses and Dissertations

Traditional critical path methods imply the assumption of unlimited availability of resources. Mathematical models and heuristic techniques are two alternatives that consider resource limitation to sequence the activities of a project. This research explores the consideration of project scheduling under resource constraints for the specific case of single resource, single project scheduling. A computer model called GENRES-II search model is developed using a modification of Brooks' algorithm to develop project schedules. The criteria used are various weighted combinations of ACTIM, ACTRES and ACTFOL. An improvement of GENRES-II solutions is obtained when the best set of GEN-II values is input to …

Project Scheduling Under Constrained Resources, Mohammed Benameur

Retrospective Theses and Dissertations

This report examines the widely acceptable Heuristic and Exact procedures for solving the problem of project scheduling and control under constrained resources. Heuristic approaches are more practical, however they depend on the type of the project as well as the resources involved. Exact procedures are illustrated using an Integer Linear Programming formulation of the problem, and also solving it using the Branch and Bound Technique. Impracticality of the exact methods stews from the fact that the computations expand to an unmanageable amount.