A fast greedy heuristic for scheduling modular projects.
Martijn HuysmansKris CoolenFabrice Talla NobibonRoel LeusPublished in: J. Heuristics (2015)
Keyphrases
- greedy heuristic
- np hard
- scheduling problem
- greedy algorithm
- minimum weight
- knapsack problem
- scheduling algorithm
- worst case analysis
- lower bound
- set cover
- software development
- round robin
- case study
- modular structure
- special case
- parallel processors
- precedence constraints
- dynamic scheduling
- genetic algorithm
- scheduling strategy
- project management
- optimal solution
- data mining
- resource constraints
- single machine
- flexible manufacturing systems
- resource allocation
- evolutionary algorithm
- preventive maintenance
- objective function
- wafer fabrication