Author:
Bellenguez-Morineau Odile
Publisher
Springer Science and Business Media LLC
Subject
Computational Theory and Mathematics,Theoretical Computer Science,Management Information Systems,Management Science and Operations Research
Reference9 articles.
1. Baptiste Ph, Le Pape C, Nuitjen W (1999) Satisfiability tests and time-bound adjustments for cumulative scheduling problems. Ann Oper Res 92:305–333
2. Bellenguez O, Néron E (2004) Methods for solving the multi-skill project scheduling problem. Ninth international workshop on project management and scheduling, Nancy, pp 66–69
3. Bellenguez O, Néron E (2005) Lower bounds for the multi-skill project scheduling problem with hierarchical levels of skills. Lecture Notes in Computer Science 3616/2005: Practice and Theory of Automated Timetabling V: 5th international conference, PATAT 2004, Pittsburgh, PA, USA, August 18–20, 2004, Revised Selected Papers, Springer, pp 229–243
4. Bellenguez-Morineau O, Néron E (2006) A branch-and-bound method for solving multi-skill project scheduling problem. RAIRO-RO (in press)
5. Carlier J, Latapie B (1991) Une méthode arborescente pour résoudre les problèmes cumulatifs. RAIRO-RO 25(3):311–340
Cited by
29 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献