A heuristic procedure to solve the project staffing problem with discrete time/resource trade-offs and personnel scheduling constraints.
Mick Van Den EeckhoutBroos MaenhoutMario VanhouckePublished in: Comput. Oper. Res. (2019)
Keyphrases
- mixed integer program
- resource constraints
- trade off
- feasible solution
- linear program
- mixed integer
- resource allocation
- lot sizing
- lagrangian relaxation
- scheduling problem
- objective function
- case study
- iterative repair
- valid inequalities
- integer program
- constraint satisfaction
- information systems
- data processing
- optimal solution
- linear programming
- tabu search
- finding an optimal solution
- constraint violations
- round robin
- resource consumption
- lower and upper bounds
- parallel machines
- markov chain
- search procedure
- grid environment
- end users
- np hard
- search algorithm
- precedence constraints
- job shop scheduling problem
- solution quality