An integer programming based algorithm for the resource constrained project scheduling problem

Simple item page
buir.advisorOğuz, Osman
dc.contributor.authorBüyüktahtakın, İsmet Esra
dc.date.accessioned2016-01-08T20:18:04Z
dc.date.available2016-01-08T20:18:04Z
dc.date.issued2005
dc.descriptionAnkara : The Department of Industrial Engineering and the Institute of Engineering and Sciences of Bilkent Univ., 2005.en_US
dc.descriptionThesis (Master's) -- Bilkent University, 2005.en_US
dc.descriptionIncludes bibliographical references leaves 48-54.en_US
dc.description.abstractIn this thesis, we study the problem of scheduling the activities of a single project in order for all resource and precedence relationships constraints to be satisfied with an objective of minimizing the project completion time. To solve this problem, we propose an Integer Programming based approximation algorithm, which has two phases. In the first phase of the algorithm, a subproblem generation technique and enumerative cuts used to tighten the formulation of the problem are presented. If an optimal solution is not found within a predetermined time limit, we continue with the second phase that uses the cuts and the lower bound obtained in the first phase. In order to evaluate the efficiency of our algorithm, we used the benchmark instances in the literature and compared the results with the best known solutions available for these instances. Finally, the computational results are reported and discussed.en_US
dc.description.provenanceMade available in DSpace on 2016-01-08T20:18:04Z (GMT). No. of bitstreams: 1 1.pdf: 78510 bytes, checksum: d85492f20c2362aa2bcf4aad49380397 (MD5)en
dc.description.statementofresponsibilityBüyüktahtakın, İsmet Esraen_US
dc.format.extentx, 54 leavesen_US
dc.identifier.urihttp://hdl.handle.net/11693/18302
dc.language.isoEnglishen_US
dc.rightsinfo:eu-repo/semantics/openAccessen_US
dc.subjectProject managementen_US
dc.subject0-1 Integer programmingen_US
dc.subjectSchedulingen_US
dc.subject.lccTS157.5 .B89 2005en_US
dc.subject.lcshProduction scheduling.en_US
dc.subject.lcshProduction scheduling--Mathematical models.en_US
dc.subject.lcshIndustrial project management.en_US
dc.titleAn integer programming based algorithm for the resource constrained project scheduling problemen_US
dc.typeThesisen_US
thesis.degree.disciplineIndustrial Engineering
thesis.degree.grantorBilkent University
thesis.degree.levelMaster's
thesis.degree.nameMS (Master of Science)

Files

Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
B086982.pdf
Size:
1.36 MB
Format:
Adobe Portable Document Format
Description:
Full printable version
Download

Collections

Graduate School of Engineering and Science