hrcak mascot   Srce   HID

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: 345* citiraj
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. Preuzeto s 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, br. 2, 2012, str. 514-521. https://hrcak.srce.hr/94295. Citirano 27.09.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, br. 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), str. 514-521. Preuzeto s: https://hrcak.srce.hr/94295 (Datum pristupa: 27.09.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 [pristupljeno 27.09.2021.];4(2):514-521. Dostupno na: 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, br. 2, str. 514-521, 2012. [Online]. Dostupno na: https://hrcak.srce.hr/94295. [Citirano: 27.09.2021.]

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

Posjeta: 552 *