A rule for slack allocation proportional to the duration in a PERT network

Simple item page
dc.contributor.authorCastro Cantalejo, Javier
dc.contributor.authorGómez González, Daniel
dc.contributor.authorTejada Cazorla, Juan Antonio
dc.date.accessioned2023-06-20T09:37:37Z
dc.date.available2023-06-20T09:37:37Z
dc.date.issued2008
dc.description.abstractIn this paper, we define a new rule for the resolution of the slack allocation problem in a PERT network. This problem exists of allocating existing extra time in some paths among the activities belonging to those paths. The allocation rule that we propose assigns extra time to the activities proportionally to their durations in such a way that no path duration exceeds the completion time of the whole project. This time allocation enables us to make a schedule for the PERT project under study. We give two characterizations of the rule and we compare it with others that have been previously defined in the literature.
dc.description.departmentDepto. de Estadística e Investigación Operativa
dc.description.facultyFac. de Ciencias Matemáticas
dc.description.refereedTRUE
dc.description.statuspub
dc.eprint.idhttps://eprints.ucm.es/id/eprint/16008
dc.identifier.citationR.J. Aumann, M. Maschler, Game theoretic analysis of a bankruptcy problem from the talmud, Journal of Economic Theory 36 (1985) 195–213. G. Bergantiños, E. Sánchez, NTU PERT games, Operations Research Letters 30 (2002) 130–140. G. Bergantiños, E. Sánchez, The proportional rule for problems with constraints and claims, Mathematical Social Sciences 43 (2002)225–249. J. Castro, D. Gómez, J. Tejada, A polynomial rule for the problem of Sharing delay cost in PERT networks, Computers and Operations Research (2006), doi:10.1016/j.cor.2006.11.003. H. Moulin, Priority rules and other inequitable rationing methods, Econometrica 68 (2000) 643–684. B. O’Neill, A problem of rights arbitration from the talmud, Mathematical Social Sciences 2 (1982) 345–371. E. Shragowitz, H. Youseff, B. Lu, Iterative converging algorithms for computing bounds on durations of activities in Pert and Pert-like models, Journal of Combinatorial Optimization 7 (2003) 5–22.
dc.identifier.doi10.1016/j.ejor.2007.03.039
dc.identifier.issn0377-2217
dc.identifier.officialurlhttp://www.sciencedirect.com/science/article/pii/S0377221707003463
dc.identifier.relatedurlhttp://www.sciencedirect.com
dc.identifier.urihttps://hdl.handle.net/20.500.14352/50062
dc.journal.titleEuropean journal of operational research
dc.language.isoeng
dc.page.final570
dc.page.initial556
dc.publisherElsevier Science
dc.rights.accessRightsrestricted access
dc.subject.cdu519.8
dc.subject.keywordProject management
dc.subject.keywordProject scheduling
dc.subject.keywordSlack allocation
dc.subject.keywordPERT
dc.subject.keywordProportional rule
dc.subject.ucmInvestigación operativa (Matemáticas)
dc.subject.unesco1207 Investigación Operativa
dc.titleA rule for slack allocation proportional to the duration in a PERT network
dc.typejournal article
dc.volume.number187
dspace.entity.typePublication
relation.isAuthorOfPublicatione556dae6-6552-4157-b98a-904f3f7c9101
relation.isAuthorOfPublication4dcf8c54-8545-4232-8acf-c163330fd0fe
relation.isAuthorOfPublication77359969-4313-4334-adef-1c2d7413fbb5
relation.isAuthorOfPublication.latestForDiscoverye556dae6-6552-4157-b98a-904f3f7c9101
Download
Original bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
Tejada10.pdf
Size:
259.73 KB
Format:
Adobe Portable Document Format
Download
Collections
Artículos