In this paper, we report on a computational experiment designed to assess the efficacy of 26 heuristic decision rules which group work tasks into work stations along an assembly line such that the number of work stations required is minimized. The heuristic decision rules investigated vary from...

In service organizations, heterogeneity in workforce skills can lead to variation in end-product/service quality. The multi-mode, resource-constrained, project scheduling problem (MRCPSP), which assumes similar skills among resources in a given resource pool, accounts for differences in quality...

The problem addressed is that of scheduling the activities of a project network to minimize project duration under conditions of multiple limited resource requirements and availabilities. Various heuristic sequencing rules have been applied to this problem, and the effectiveness of these rules...

In this paper we describe an integer programming algorithm for allocating limited resources to competing activities (jobs, tasks, etc.) of a project such that the completion time of the project is minimal among all possible completion times. Typical of such problems is the minimization of the...

Bounding techniques similar to those used with branch and bound procedures are used in this study in conjunction with zero-one programming to produce minimum duration schedules for the resource constrained, project scheduling problem. The algorithms developed consist of examining the feasibility...