Resource-Window Reduction by Reduced Costs in Path-Based Formulations for Routing and Scheduling Problems.
Nicola BianchessiTimo GschwindStefan IrnichPublished in: INFORMS J. Comput. (2024)
Keyphrases
- scheduling problem
- resource consumption
- processing times
- allocation policies
- single machine
- resource allocation
- web resources
- np hard
- resource requirements
- precedence constraints
- flowshop
- ad hoc networks
- total cost
- window size
- routing algorithm
- greedy heuristics
- sliding window
- job shop scheduling
- tabu search
- routing problem
- resource management
- parallel machines
- resource constraints
- routing protocol
- spectral clustering
- setup times
- sequence dependent setup times
- routing decisions
- optimization methods
- sequencing problems
- evolutionary algorithm