Enhanced energetic reasoning-based lower bounds for the resource constrained project scheduling problem
- 31 May 2012
- journal article
- Published by Elsevier BV in Computers & Operations Research
- Vol. 39 (5), 1187-1194
- https://doi.org/10.1016/j.cor.2011.05.022
Abstract
No abstract availableThis publication has 15 references indexed in Scilit:
- IP-Based Energetic Reasoning for the Resource Constrained Project Scheduling ProblemElectronic Notes in Discrete Mathematics, 2010
- Energetic reasoning revisited: application to parallel machine schedulingJournal of Scheduling, 2008
- Fast lifting procedures for the bin packing problemDiscrete Optimization, 2005
- Satisfiability tests and time‐bound adjustmentsfor cumulative scheduling problemsAnnals of Operations Research, 1999
- New Classes of Lower Bounds for Bin Packing ProblemsLecture Notes in Computer Science, 1998
- Une méthode arborescente pour résoudre les problèmes cumulatifsRAIRO - Operations Research, 1991
- Project scheduling with resource constraints: A branch and bound approachEuropean Journal of Operational Research, 1987
- Scheduling subject to resource constraints: classification and complexityDiscrete Applied Mathematics, 1983
- Ordonnancements. La notion de «parties obligatoires» et son application aux problèmes cumulatifsRAIRO - Operations Research, 1982
- Multiple Resource–Constrained Scheduling Using Branch and BoundA I I E Transactions, 1978