A MULTIPLE OBJECTIVE PROGRAMMING FRAMEWORK FOR TRADEOFFS IN PROJECT SCHEDULING.

Saved in:
Bibliographic Details
Title: A MULTIPLE OBJECTIVE PROGRAMMING FRAMEWORK FOR TRADEOFFS IN PROJECT SCHEDULING.
Authors: Deckro, Richard F.1, Hebert, John E.2
Source: Engineering Costs & Production Economics. 1990, Vol. 18 Issue 3, p255-264. 10p.
Subjects: Linear programming, Production scheduling, Project management, Algorithms, Production management (Manufacturing), Vector analysis
Abstract: This paper presents a multiple objective linear programming (MOLP) model for project scheduling. The MOLP approach allows potentially conflicting objectives to be considered without the necessity of creating specific rankings or weights for the objectives, although such factors can be considered if they are desired. An efficient set of solutions is developed from which a final schedule may be selected by the project manager utilizing non-quantifiable criterion and factors. The approach can be implemented using computer algorithms readily available in the public domain. [ABSTRACT FROM AUTHOR]
Copyright of Engineering Costs & Production Economics is the property of Elsevier B.V. and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)
Database: Engineering Source
Description
Abstract:This paper presents a multiple objective linear programming (MOLP) model for project scheduling. The MOLP approach allows potentially conflicting objectives to be considered without the necessity of creating specific rankings or weights for the objectives, although such factors can be considered if they are desired. An efficient set of solutions is developed from which a final schedule may be selected by the project manager utilizing non-quantifiable criterion and factors. The approach can be implemented using computer algorithms readily available in the public domain. [ABSTRACT FROM AUTHOR]
ISSN:0167188X
DOI:10.1016/0167-188X(90)90128-5