Complexity results for the linear time-cost tradeoff problem with multiple milestones and completely ordered jobs

Byung-Cheon Choi; Jibok Chung

Year of publication:	2014
Authors:	Choi, Byung-cheon ; Chung, Jibok
Published in:	European journal of operational research : EJOR. - Amsterdam : Elsevier, ISSN 0377-2217, ZDB-ID 243003-4. - Vol. 236.2014, 1 (1.7.), p. 61-68
Subject:	Project scheduling \| Time-cost tradeoff \| Computational complexity \| Chain precedence graph \| Scheduling-Verfahren \| Scheduling problem \| Projektmanagement \| Project management \| Graphentheorie \| Graph theory \| Mathematische Optimierung \| Mathematical programming \| Heuristik \| Heuristics \| Netzplantechnik \| Project network techniques

Check Google Scholar |

More access options

In libraries world-wide (WorldCat)

In German libraries (KVK)

Which error do you want to report?

Report: URL of this record is broken

Please note: Sometimes more than one URL is available for a resource. Please click on "More Options" to display these URLs

Report: Addition of an URL to that resource

Please note: Sometimes more than one URL is available for a resource. Please click on "More Options" to display these URLs

Report: The language(s) of that resource is/are…

Please note: Required language not in the list? Please use comment field

Report: Addition of an identifier to that resource

Report: report typo

Report: Add statement

Report: Add keywords

Please use the commentary box to describe other errors

Would you like to receive a feedback?

Commentary

Please type the code from the image

For general questions please use this address.

Persistent link: https://www.econbiz.de/10010361777

A service of the