Branch and bound based solution algorithms for the budget constrained discrete time/cost trade-off problem
Year of publication: |
2013
|
---|---|
Authors: | Değirmenci, G. ; Azizoğlu, M. |
Published in: |
Journal of the Operational Research Society : OR. - Basingstoke, Hampshire : Palgrave, ISSN 0030-3623, ZDB-ID 716033-1. - Vol. 64.2013, 10, p. 1474-1484
|
Subject: | project management | time/cost trade-off | budget problem | Projektmanagement | Project management | Algorithmus | Algorithm | Theorie | Theory | Scheduling-Verfahren | Scheduling problem | Branch-and-Bound | Branch and Bound |
-
Liu, Ying, (2023)
-
An enhanced branch-and-bound algorithm for the talent scheduling problem
Qin, Hu, (2016)
-
Rostami, Mohammad, (2020)
- More ...
-
Flow shop-sequencing problem with synchronous transfers and makespan minimization
Soylu, B., (2007)
-
Single machine scheduling with preventive maintenances
Batun, S., (2009)
-
A fixed job scheduling problem with machine-dependent job weights
Eliiyi, D.T., (2009)
- More ...