A Comparison of Due Date Setting, Resource Assignment, and Job Preemption Heuristics for the Multiproject Scheduling Problem*

Abstract

This research examines a heuristic, rule‐based approach for setting due dates in a multiproject, multijob, or assembly shop. Due date estimation is a challenging problem because the operating environment is capacitated, involves the allocation of multiple resources, and allows for the preemption of resources from one project or job to another. The dynamic, continuous arrival of new jobs or orders frequently results in the preemption of resources through the application of managerially determined priority policies. These preemption policies have a significant impact on the ultimate completion time of a job or a project.A three‐factor, full‐factorial computer simulation experiment is used to assess the relative effectiveness of combinations of four due date setting heuristics, five resource assignment heuristics, and three resource preemption heuristics. Recommendations are made for the selection of due date and resource assignment heuristic combinations under the three preemption policies examined.