Heuristic Methods for Assigning Men to Machines: An Experimental Analysis

Authors:

Abstract
This paper describes a labor assignment decision frequently encountered in production operations where: 1) one operator can service several semi-automatic machines simultaneously, 2) the operator service and machine processing times vary considerably among machines, and 3) the combined costs of idle labor and machine time are to be minimized in preparing a work schedule. Two heuristics for determining labor assignments are described: the man-loading and labor-saved heuristics. Experimental results are reported that compare the heuristics with respect to: 1) the proximity of their solutions to an optimum solution derived using a branch and bound algorithm, 2) their computational efficiency, and 3) the dependency of their performance on the data considered in the experiments.