Portal de Periódicos da CAPES

The multiple resource constrained project scheduling problem: A breadth-first approach

1999; Elsevier BV; Volume: 112; Issue: 2 Linguagem: Inglês

10.1016/s0377-2217(97)00402-5

1872-6860

Terence Nazareth, Verma Sanjay, Subir Bhattacharya, A. Bagchi,

Scheduling and Timetabling Solutions

We describe a simple breadth-first tree search scheme for minimizing the makespan of a project consisting of a partially ordered network of activities under multiple resource constraints. The method compares quite favourably with existing techniques that employ depth-first or best-first search; in particular, it is able to solve optimally on a Pentium PC running SCO UNIX the entire set of 680 benchmark problems (First Lot: 480, Second Lot: 200) generated by Kolisch et al., 1995. The new algorithm has also been checked out experimentally on additional random test problems at graded levels of difficulty that were generated using two parameters: the threshold, which determined the predecessors of an activity, and the total resource availability of each resource type. The breadth-first scheme can be modified quite readily to do best-first search or to minimize measures other than makespan such as mean flow time and maximum tardiness.