IDEAS home Printed from https://ideas.repec.org/r/inm/ormnsc/v49y2003i3p330-350.html
   My bibliography  Save this item

Solving Project Scheduling Problems by Minimum Cut Computations

Citations

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


Cited by:

  1. Estévez-Fernández, Arantza, 2012. "A game theoretical approach to sharing penalties and rewards in projects," European Journal of Operational Research, Elsevier, vol. 216(3), pages 647-657.
  2. Nurre, Sarah G. & Cavdaroglu, Burak & Mitchell, John E. & Sharkey, Thomas C. & Wallace, William A., 2012. "Restoring infrastructure systems: An integrated network design and scheduling (INDS) problem," European Journal of Operational Research, Elsevier, vol. 223(3), pages 794-806.
  3. Peymankar, Mahboobeh & Davari, Morteza & Ranjbar, Mohammad, 2021. "Maximizing the expected net present value in a project with uncertain cash flows," European Journal of Operational Research, Elsevier, vol. 294(2), pages 442-452.
  4. R. Christopher L. Riley & Cesar Rego, 2019. "Intensification, diversification, and learning via relaxation adaptive memory programming: a case study on resource constrained project scheduling," Journal of Heuristics, Springer, vol. 25(4), pages 793-807, October.
  5. Valls, Vicente & Ballestin, Francisco & Quintanilla, Sacramento, 2005. "Justification and RCPSP: A technique that pays," European Journal of Operational Research, Elsevier, vol. 165(2), pages 375-386, September.
  6. Gonzalo Muñoz & Daniel Espinoza & Marcos Goycoolea & Eduardo Moreno & Maurice Queyranne & Orlando Rivera Letelier, 2018. "A study of the Bienstock–Zuckerberg algorithm: applications in mining and resource constrained project scheduling," Computational Optimization and Applications, Springer, vol. 69(2), pages 501-534, March.
  7. Damay, Jean & Quilliot, Alain & Sanlaville, Eric, 2007. "Linear programming based algorithms for preemptive and non-preemptive RCPSP," European Journal of Operational Research, Elsevier, vol. 182(3), pages 1012-1022, November.
  8. Konstantinos G. Zografos & Michael A. Madas & Konstantinos N. Androutsopoulos, 2017. "Increasing airport capacity utilisation through optimum slot scheduling: review of current developments and identification of future needs," Journal of Scheduling, Springer, vol. 20(1), pages 3-24, February.
  9. Alexander Tesch, 2020. "A polyhedral study of event-based models for the resource-constrained project scheduling problem," Journal of Scheduling, Springer, vol. 23(2), pages 233-251, April.
  10. Hartmann, Sönke, 2011. "Project scheduling with resource capacities and requests varying with time," Working Paper Series 01/2011, Hamburg School of Business Administration (HSBA).
  11. Tseng, Lin-Yu & Chen, Shih-Chieh, 2006. "A hybrid metaheuristic for the resource-constrained project scheduling problem," European Journal of Operational Research, Elsevier, vol. 175(2), pages 707-721, December.
  12. Sophie Demassey & Christian Artigues & Philippe Michelon, 2005. "Constraint-Propagation-Based Cutting Planes: An Application to the Resource-Constrained Project Scheduling Problem," INFORMS Journal on Computing, INFORMS, vol. 17(1), pages 52-65, February.
  13. Lixin Tang & Ying Meng & Zhi-Long Chen & Jiyin Liu, 2016. "Coil Batching to Improve Productivity and Energy Utilization in Steel Production," Manufacturing & Service Operations Management, INFORMS, vol. 18(2), pages 262-279, May.
  14. Kolisch, Rainer & Hartmann, Sonke, 2006. "Experimental investigation of heuristics for resource-constrained project scheduling: An update," European Journal of Operational Research, Elsevier, vol. 174(1), pages 23-37, October.
  15. Yunpeng Pan & Zhe Liang, 2017. "Dual relaxations of the time-indexed ILP formulation for min–sum scheduling problems," Annals of Operations Research, Springer, vol. 249(1), pages 197-213, February.
  16. Valls, Vicente & Ballestin, Francisco & Quintanilla, Sacramento, 2008. "A hybrid genetic algorithm for the resource-constrained project scheduling problem," European Journal of Operational Research, Elsevier, vol. 185(2), pages 495-508, March.
  17. Chen, Jiaqiong & Askin, Ronald G., 2009. "Project selection, scheduling and resource allocation with time dependent returns," European Journal of Operational Research, Elsevier, vol. 193(1), pages 23-34, February.
  18. Berghman, Lotte & Leus, Roel, 2015. "Practical solutions for a dock assignment problem with trailer transportation," European Journal of Operational Research, Elsevier, vol. 246(3), pages 787-799.
  19. Kedad-Sidhoum, Safia & Solis, Yasmin Rios & Sourd, Francis, 2008. "Lower bounds for the earliness-tardiness scheduling problem on parallel machines with distinct due dates," European Journal of Operational Research, Elsevier, vol. 189(3), pages 1305-1316, September.
  20. Alessandro Hill & Andrea J. Brickey & Italo Cipriano & Marcos Goycoolea & Alexandra Newman, 2022. "Optimization Strategies for Resource-Constrained Project Scheduling Problems in Underground Mining," INFORMS Journal on Computing, INFORMS, vol. 34(6), pages 3042-3058, November.
  21. Hartmann, Sönke & Briskorn, Dirk, 2008. "A survey of variants and extensions of the resource-constrained project scheduling problem," Working Paper Series 02/2008, Hamburg School of Business Administration (HSBA).
  22. Maryam Sadeghloo & Saeed Emami & Ali Divsalar, 2024. "A Benders decomposition algorithm for the multi-mode resource-constrained multi-project scheduling problem with uncertainty," Annals of Operations Research, Springer, vol. 339(3), pages 1637-1677, August.
  23. Bianco, Lucio & Caramia, Massimiliano, 2012. "An exact algorithm to minimize the makespan in project scheduling with scarce resources and generalized precedence relations," European Journal of Operational Research, Elsevier, vol. 219(1), pages 73-85.
  24. Guopeng Song & Tamás Kis & Roel Leus, 2021. "Polyhedral Results and Branch-and-Cut for the Resource Loading Problem," INFORMS Journal on Computing, INFORMS, vol. 33(1), pages 105-119, January.
  25. Hartmann, Sönke & Briskorn, Dirk, 2010. "A survey of variants and extensions of the resource-constrained project scheduling problem," European Journal of Operational Research, Elsevier, vol. 207(1), pages 1-14, November.
  26. G Zhu & J F Bard & G Yu, 2005. "Disruption management for resource-constrained project scheduling," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 56(4), pages 365-381, April.
  27. de Azevedo, Guilherme Henrique Ismael & Pessoa, Artur Alves & Subramanian, Anand, 2021. "A satisfiability and workload-based exact method for the resource constrained project scheduling problem with generalized precedence constraints," European Journal of Operational Research, Elsevier, vol. 289(3), pages 809-824.
  28. Douglas Altner & Özlem Ergun, 2011. "Rapidly computing robust minimum capacity s-t cuts: a case study in solving a sequence of maximum flow problems," Annals of Operations Research, Springer, vol. 184(1), pages 3-26, April.
  29. Milind Dawande & Zhichao Feng & Ganesh Janakiraman, 2021. "On the Structure of Bottlenecks in Processes," Management Science, INFORMS, vol. 67(6), pages 3853-3870, June.
  30. Joseph G. Szmerekovsky, 2005. "The Impact of Contractor Behavior on the Client's Payment-Scheduling Problem," Management Science, INFORMS, vol. 51(4), pages 629-640, April.
  31. Kerkhove, L.-P. & Vanhoucke, M., 2017. "Optimised scheduling for weather sensitive offshore construction projects," Omega, Elsevier, vol. 66(PA), pages 58-78.
IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.