hrcak mascot   Srce   HID

Original scientific paper

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

Helga Csordas

Fulltext: english, pdf (787 KB) pages 514-521 downloads: 345* cite
APA 6th Edition
Csordas, H. (2012). Scheduling in Networks with Time Dependent Arc Lengths Based on a Loop Finder Algorithm. Organization, technology & management in construction, 4 (2), 514-521. Retrieved from https://hrcak.srce.hr/94295
MLA 8th Edition
Csordas, Helga. "Scheduling in Networks with Time Dependent Arc Lengths Based on a Loop Finder Algorithm." Organization, technology & management in construction, vol. 4, no. 2, 2012, pp. 514-521. https://hrcak.srce.hr/94295. Accessed 22 Sep. 2021.
Chicago 17th Edition
Csordas, Helga. "Scheduling in Networks with Time Dependent Arc Lengths Based on a Loop Finder Algorithm." Organization, technology & management in construction 4, no. 2 (2012): 514-521. https://hrcak.srce.hr/94295
Harvard
Csordas, H. (2012). 'Scheduling in Networks with Time Dependent Arc Lengths Based on a Loop Finder Algorithm', Organization, technology & management in construction, 4(2), pp. 514-521. Available at: https://hrcak.srce.hr/94295 (Accessed 22 September 2021)
Vancouver
Csordas H. Scheduling in Networks with Time Dependent Arc Lengths Based on a Loop Finder Algorithm. Organization, technology & management in construction [Internet]. 2012 [cited 2021 September 22];4(2):514-521. Available from: https://hrcak.srce.hr/94295
IEEE
H. Csordas, "Scheduling in Networks with Time Dependent Arc Lengths Based on a Loop Finder Algorithm", Organization, technology & management in construction, vol.4, no. 2, pp. 514-521, 2012. [Online]. Available: https://hrcak.srce.hr/94295. [Accessed: 22 September 2021]

Abstracts
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.

Keywords
project scheduling; time dependent activity; loop; algorithm

Hrčak ID: 94295

URI
https://hrcak.srce.hr/94295

Visits: 552 *