Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/1835
PIRA download icon_1.1View/Download Full Text
DC FieldValueLanguage
dc.contributorDepartment of Logistics and Maritime Studies-
dc.creatorHalman, N-
dc.creatorLi, CL-
dc.creatorSimchi-Levi, D-
dc.date.accessioned2014-12-11T08:25:30Z-
dc.date.available2014-12-11T08:25:30Z-
dc.identifier.issn0167-6377-
dc.identifier.urihttp://hdl.handle.net/10397/1835-
dc.language.isoenen_US
dc.publisherElsevieren_US
dc.rightsOperations Research Letters © 2009 Elsevier B.V. The journal web site is located at http://www.sciencedirect.com.en_US
dc.subjectProject managementen_US
dc.subjectTime–cost tradeoffen_US
dc.subjectApproximation algorithmsen_US
dc.titleFully polynomial-time approximation schemes for time–cost tradeoff problems in series–parallel project networksen_US
dc.typeJournal/Magazine Articleen_US
dc.identifier.spage239-
dc.identifier.epage244-
dc.identifier.volume37-
dc.identifier.issue4-
dc.identifier.doi10.1016/j.orl.2009.03.002-
dcterms.abstractWe consider the deadline problem and budget problem of the nonlinear time–cost tradeoff project scheduling model in a series–parallel activity network. We develop fully polynomial-time approximation schemes for both problems using K-approximation sets and functions, together with series and parallel reductions.-
dcterms.accessRightsopen accessen_US
dcterms.bibliographicCitationOperations research letters, July 2009, v. 37, no. 4, p. 239-244-
dcterms.isPartOfOperations research letters-
dcterms.issued2009-07-
dc.identifier.isiWOS:000268431300003-
dc.identifier.scopus2-s2.0-67449158753-
dc.identifier.eissn1872-7468-
dc.identifier.rosgroupidr48344-
dc.description.ros2009-2010 > Academic research: refereed > Publication in refereed journal-
dc.description.oaAccepted Manuscripten_US
dc.identifier.FolderNumberOA_IR/PIRAen_US
dc.description.pubStatusPublisheden_US
Appears in Collections:Journal/Magazine Article
Files in This Item:
File Description SizeFormat 
62 Final-Version.pdfPre-published version227.07 kBAdobe PDFView/Open
Open Access Information
Status open access
File Version Final Accepted Manuscript
Access
View full-text via PolyU eLinks SFX Query
Show simple item record

Page views

152
Last Week
3
Last month
Citations as of Apr 21, 2024

Downloads

233
Citations as of Apr 21, 2024

SCOPUSTM   
Citations

10
Last Week
0
Last month
0
Citations as of Apr 19, 2024

WEB OF SCIENCETM
Citations

9
Last Week
0
Last month
0
Citations as of Apr 25, 2024

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.