A comparative study of computational procedures for the resource constrained project scheduling problem

Files

A_comparative_study_of_computational_procedures_for_the_resource_constrained_project_schedulin_ problem.pdf (770.18 KB)

Date

1994

Authors

Oğuz, O.
Bala, H.

Editor(s)

Advisor

Supervisor

Co-Advisor

Co-Supervisor

Instructor

BUIR Usage Stats
1
views
19
downloads

Citation Stats

  • Share

Series

Abstract

Performance of two new integer programming based heuristics together with some special purpose algorithms for project scheduling are tested from a computational point of view. The objective of the study is to compare the quality of solutions obtained by using these algorithms and reach conclusions about their relative merits on this specific problem. © 1994.

Source Title

European Journal of Operational Research

Publisher

Elsevier

Course

Other identifiers

Book Title

Keywords

Heuristics, Integer programming, Project scheduling, Algorithms, Computational complexity, Computational methods, Heuristic methods, Mathematical programming, Performance, Project management, Integer programming, Project scheduling, Scheduling

Degree Discipline

Degree Level

Degree Name

Citation

Permalink

http://hdl.handle.net/11693/25970

Published Version (Please cite this version)

http://dx.doi.org/10.1016/0377-2217(94)90319-0

Collections

Scholarly Publications - Industrial Engineering

Language

English

Type

Article