IDEAS home Printed from https://ideas.repec.org/r/eee/ejores/v81y1995i2p225-238.html
   My bibliography  Save this item

The discrete time-cost tradeoff problem revisited

Citations

Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
as


Cited by:

  1. Martin Skutella, 1998. "Approximation Algorithms for the Discrete Time-Cost Tradeoff Problem," Mathematics of Operations Research, INFORMS, vol. 23(4), pages 909-929, November.
  2. HazIr, Öncü & Haouari, Mohamed & Erel, Erdal, 2010. "Robust scheduling and robustness measures for the discrete time/cost trade-off problem," European Journal of Operational Research, Elsevier, vol. 207(2), pages 633-643, December.
  3. Marcin Anholcer & Helena Gaspars-Wieloch, 2011. "Efficiency analysis of the Kaufmann and Dezbazeille algorithm for the deadline problem," Operations Research and Decisions, Wroclaw University of Science and Technology, Faculty of Management, vol. 21(1), pages 5-18.
  4. Vanhoucke, Mario, 2005. "New computational results for the discrete time/cost trade-off problem with time-switch constraints," European Journal of Operational Research, Elsevier, vol. 165(2), pages 359-374, September.
  5. Zhang, Jingwen & Elmaghraby, Salah E., 2014. "The relevance of the “alphorn of uncertainty” to the financial management of projects under uncertainty," European Journal of Operational Research, Elsevier, vol. 238(1), pages 65-76.
  6. Kolisch, R. & Padman, R., 2001. "An integrated survey of deterministic project scheduling," Omega, Elsevier, vol. 29(3), pages 249-272, June.
  7. R L Bregman, 2009. "Preemptive expediting to improve project due date performance," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 60(1), pages 120-129, January.
  8. Ma, Jun & Nault, Barrie R. & Tu, Yiliu (Paul), 2023. "Customer segmentation, pricing, and lead time decisions: A stochastic-user-equilibrium perspective," International Journal of Production Economics, Elsevier, vol. 264(C).
  9. Eleni Hadjiconstantinou & Evelina Klerides, 2010. "A new path-based cutting plane approach for the discrete time-cost tradeoff problem," Computational Management Science, Springer, vol. 7(3), pages 313-336, July.
  10. Mick Van Den Eeckhout & Broos Maenhout & Mario Vanhoucke, 2020. "Mode generation rules to define activity flexibility for the integrated project staffing problem with discrete time/resource trade-offs," Annals of Operations Research, Springer, vol. 292(1), pages 133-160, September.
  11. Dharma Kwon, H. & Lippman, Steven A. & Tang, Christopher S., 2011. "Sourcing decisions of project tasks with exponential completion times: Impact on operating profits," International Journal of Production Economics, Elsevier, vol. 134(1), pages 138-150, November.
  12. Collin Huse & Michael J. Brusco, 2021. "A Tale of Two Linear Programming Formulations for Crashing Project Networks," INFORMS Transactions on Education, INFORMS, vol. 22(1), pages 82-95, January.
  13. Asadabadi, Mehdi Rajabi & Zwikael, Ofer, 2021. "Integrating risk into estimations of project activities' time and cost: A stratified approach," European Journal of Operational Research, Elsevier, vol. 291(2), pages 482-490.
  14. Brucker, Peter & Drexl, Andreas & Mohring, Rolf & Neumann, Klaus & Pesch, Erwin, 1999. "Resource-constrained project scheduling: Notation, classification, models, and methods," European Journal of Operational Research, Elsevier, vol. 112(1), pages 3-41, January.
  15. Weglarz, Jan & Józefowska, Joanna & Mika, Marek & Waligóra, Grzegorz, 2011. "Project scheduling with finite or infinite number of activity processing modes - A survey," European Journal of Operational Research, Elsevier, vol. 208(3), pages 177-205, February.
  16. Zhengwen He & Nengmin Wang & Pengxiang Li, 2014. "Simulated annealing for financing cost distribution based project payment scheduling from a joint perspective," Annals of Operations Research, Springer, vol. 213(1), pages 203-220, February.
  17. Bregman, Robert L., 2009. "A heuristic procedure for solving the dynamic probabilistic project expediting problem," European Journal of Operational Research, Elsevier, vol. 192(1), pages 125-137, January.
  18. Hongbo Li & Zhe Xu & Wenchao Wei, 2018. "Bi-Objective Scheduling Optimization for Discrete Time/Cost Trade-Off in Projects," Sustainability, MDPI, vol. 10(8), pages 1-15, August.
  19. Kosztyán, Zsolt T. & Pribojszki-Németh, Anikó & Szalkai, István, 2019. "Hybrid multimode resource-constrained maintenance project scheduling problem," Operations Research Perspectives, Elsevier, vol. 6(C).
  20. Mohamed Hussein & Abdelrahman E. E. Eltoukhy & Amos Darko & Amr Eltawil, 2021. "Simulation-Optimization for the Planning of Off-Site Construction Projects: A Comparative Study of Recent Swarm Intelligence Metaheuristics," Sustainability, MDPI, vol. 13(24), pages 1-41, December.
  21. Cyril Briand & Sandra Ulrich Ngueveu & Přemysl Šůcha, 2017. "Finding an optimal Nash equilibrium to the multi-agent project scheduling problem," Journal of Scheduling, Springer, vol. 20(5), pages 475-491, October.
  22. Xue Li & Zhengwen He & Nengmin Wang & Mario Vanhoucke, 2022. "Multimode time-cost-robustness trade-off project scheduling problem under uncertainty," Journal of Combinatorial Optimization, Springer, vol. 43(5), pages 1173-1202, July.
  23. Said, Samer S. & Haouari, Mohamed, 2015. "A hybrid simulation-optimization approach for the robust Discrete Time/Cost Trade-off Problem," Applied Mathematics and Computation, Elsevier, vol. 259(C), pages 628-636.
  24. HazIr, Öncü & Erel, Erdal & Günalay, Yavuz, 2011. "Robust optimization models for the discrete time/cost trade-off problem," International Journal of Production Economics, Elsevier, vol. 130(1), pages 87-95, March.
  25. Nicole Megow & Rolf H. Möhring & Jens Schulz, 2011. "Decision Support and Optimization in Shutdown and Turnaround Scheduling," INFORMS Journal on Computing, INFORMS, vol. 23(2), pages 189-204, May.
  26. Palit, Niladri & Brint, Andrew, 2020. "The effect of risk aversion on the optimal project resource rate," European Journal of Operational Research, Elsevier, vol. 287(3), pages 1092-1104.
  27. He, Zhengwen & Wang, Nengmin & Jia, Tao & Xu, Yu, 2009. "Simulated annealing and tabu search for multi-mode project payment scheduling," European Journal of Operational Research, Elsevier, vol. 198(3), pages 688-696, November.
  28. Akkan, Can & Drexl, Andreas & Kimms, Alf, 2005. "Network decomposition-based benchmark results for the discrete time-cost tradeoff problem," European Journal of Operational Research, Elsevier, vol. 165(2), pages 339-358, September.
  29. Wei He & Wenjing Li & Wei Wang, 2021. "Developing a Resource Allocation Approach for Resource-Constrained Construction Operation under Multi-Objective Operation," Sustainability, MDPI, vol. 13(13), pages 1-22, June.
  30. Akkan, Can & Drexl, Andreas & Kimms, Alf, 2000. "Network decomposition-based lower and upper bounds for the discrete time-cost tradeoff problem," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 527, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
  31. Kosztyán, Zsolt T. & Szalkai, István, 2018. "Hybrid time-quality-cost trade-off problems," Operations Research Perspectives, Elsevier, vol. 5(C), pages 306-318.
IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.