Skoči na glavni sadržaj

Izvorni znanstveni članak

Scheduling in Networks with Time Dependent Arc Lengths Based on a Loop Finder Algorithm

Helga Csordas


Puni tekst: engleski pdf 787 Kb

str. 514-521

preuzimanja: 424

citiraj


Sažetak

Network models are often applied in project scheduling. Here a longest path problem has to be solved to get the project duration. There are many generalizations in this theme. One of these is applying time dependent process durations. This potential is very important because this is the key to use calendars in schedules. An other one is applying maximal constraints which result loops in the schedule. If these two potentials are allowed together, the prefix of length of the loops can change according the start time. An algorithm has been already presented for this problem. This study is an opportunity to accelerate it.

Ključne riječi

project scheduling; time dependent activity; loop; algorithm

Hrčak ID:

94295

URI

https://hrcak.srce.hr/94295

Datum izdavanja:

3.12.2012.

Posjeta: 807 *