Content area
The feasibility of using a modestly priced microcomputer to solve weekly labor tour-scheduling problems is investigated, using a new solution approach. The results from a previous experimental analysis using a mainframe computer showed that the implementation of this new approach has the potential to provide substantial improvement in labor utilization. The applicability of the approach to small service organizations that currently do not have the capability to schedule their workers using large mainframe computers is demonstrated. The results clearly support the feasibility of using microcomputers to solve workforce scheduling problems of a size that might well be expected in a typical service organization. They are particularly encouraging for labor-intensive service firms that do not have access to mainframe computers. Optimal or near optimal integer solutions to all 128 tour-scheduling problems were obtained using implicit modeling and a modestly priced microcomputer system. Fully 96% of the test problems were solved within a one-hour CPU time limit.