An efficient pseudo-polynomial algorithm for finding a lower bound on the makespan for the Resource Constrained Project Scheduling Problem

Dmitry I. Arkhipov, Olga Battaïa, Alexander A. Lazarev. An efficient pseudo-polynomial algorithm for finding a lower bound on the makespan for the Resource Constrained Project Scheduling Problem. European Journal of Operational Research, 275(1):35-44, 2019. [doi]

@article{ArkhipovBL19,
  title = {An efficient pseudo-polynomial algorithm for finding a lower bound on the makespan for the Resource Constrained Project Scheduling Problem},
  author = {Dmitry I. Arkhipov and Olga Battaïa and Alexander A. Lazarev},
  year = {2019},
  doi = {10.1016/j.ejor.2018.11.005},
  url = {https://doi.org/10.1016/j.ejor.2018.11.005},
  researchr = {https://researchr.org/publication/ArkhipovBL19},
  cites = {0},
  citedby = {0},
  journal = {European Journal of Operational Research},
  volume = {275},
  number = {1},
  pages = {35-44},
}