Une méthode arborescente pour résoudre les problèmes cumulatifs
RAIRO-Oper. Res., 25 3 (1991) 311-340
Published online: 2017-02-06
Articles citing this article
The Citing articles tool gives a list of articles citing the current article.
The citing articles come from EDP Sciences database, as well as other publishers participating in CrossRef Cited-by Linking Program. You can set up your personal account to receive an email alert each time this article is cited by a new article (see the menu on the right-hand side of the abstract page).
Cited article:
This article has been cited by the following article(s):
Integration of Constraint Programming, Artificial Intelligence, and Operations Research
Claire Hanen, Alix Munier Kordon and Theo PedersenLecture Notes in Computer Science, Integration of Constraint Programming, Artificial Intelligence, and Operations Research 12735 214 (2021)
https://doi.org/10.1007/978-3-030-78230-6_14
An efficient pseudo-polynomial algorithm for finding a lower bound on the makespan for the Resource Constrained Project Scheduling Problem
Dmitry Arkhipov, Olga Battaïa and Alexander LazarevEuropean Journal of Operational Research 275 (1) 35 (2019)
https://doi.org/10.1016/j.ejor.2018.11.005
A preemptive bound for the Resource Constrained Project Scheduling Problem
Mohamed Haouari, Anis Kooli, Emmanuel Néron and Jacques CarlierJournal of Scheduling 17 (3) 237 (2014)
https://doi.org/10.1007/s10951-013-0354-9
Enhanced energetic reasoning-based lower bounds for the resource constrained project scheduling problem
Mohamed Haouari, Anis Kooli and Emmanuel NéronComputers & Operations Research 39 (5) 1187 (2012)
https://doi.org/10.1016/j.cor.2011.05.022
Methods to solve multi-skill project scheduling problem
Odile Bellenguez-Morineau4OR 6 (1) 85 (2008)
https://doi.org/10.1007/s10288-007-0038-4
An approximate decomposition algorithm for scheduling on parallel machines with heads and tails
Anis Gharbi and Mohamed HaouariComputers & Operations Research 34 (3) 868 (2007)
https://doi.org/10.1016/j.cor.2005.05.012
Energetic reasoning and bin-packing problem, for bounding a parallel machine scheduling problem
Fabrice Tercinet, Emmanuel Néron and Christophe Lenté4OR 4 (4) 297 (2006)
https://doi.org/10.1007/s10288-006-0017-1
Optimal parallel machines scheduling with availability constraints
Anis Gharbi and Mohamed HaouariDiscrete Applied Mathematics 148 (1) 63 (2005)
https://doi.org/10.1016/j.dam.2004.12.003
Jackson's pseudo-preemptive schedule and cumulative scheduling problems
Jacques Carlier and Eric PinsonDiscrete Applied Mathematics 145 (1) 80 (2004)
https://doi.org/10.1016/j.dam.2003.09.009
On linear lower bounds for the resource constrained project scheduling problem
J. Carlier and E. NéronEuropean Journal of Operational Research 149 (2) 314 (2003)
https://doi.org/10.1016/S0377-2217(02)00763-4
A branch and bound algorithm for the resource-constrained project scheduling problem
Peter Brucker, Sigrid Knust, Arno Schoo and Olaf ThieleEuropean Journal of Operational Research 107 (2) 272 (1998)
https://doi.org/10.1016/S0377-2217(97)00335-4
Principles and Practice of Constraint Programming-CP97
Philippe Baptiste and Claude Le PapeLecture Notes in Computer Science, Principles and Practice of Constraint Programming-CP97 1330 375 (1997)
https://doi.org/10.1007/BFb0017454
Characterization of a set of schedules in a multiple resource context
Jean-Claude Billaut and François RoubellatJournal of Decision Systems 5 (1-2) 95 (1996)
https://doi.org/10.1080/12460125.1996.10511676