Methods to solve multi-skill project scheduling problem
- 30 March 2007
- journal article
- Published by Springer Nature in 4OR
- Vol. 6 (1), 85-88
- https://doi.org/10.1007/s10288-007-0038-4
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- A Branch-and-Bound method for solving Multi-Skill Project Scheduling ProblemRairo-Operations Research, 2007
- Lower Bounds for the Multi-skill Project Scheduling Problem with Hierarchical Levels of SkillsLecture Notes in Computer Science, 2005
- Solving hybrid flow shop problem using energetic reasoning and global operationsOmega, 2001
- Scheduling of Resource-Constrained ProjectsPublished by Springer Nature ,2000
- Satisfiability tests and time‐bound adjustmentsfor cumulative scheduling problemsAnnals of Operations Research, 1999
- An Exact Algorithm for the Resource-Constrained Project Scheduling Problem Based on a New Mathematical FormulationManagement Science, 1998
- On the computational complexity of (maximum) class schedulingEuropean Journal of Operational Research, 1991
- Une méthode arborescente pour résoudre les problèmes cumulatifsRairo-Operations Research, 1991