Pages that link to "Item:Q954251"
From MaRDI portal
The following pages link to Improving simulated annealing with variable neighborhood search to solve the resource-constrained scheduling problem (Q954251):
Displaying 12 items.
- Hybrid algorithms for hardware/software partitioning and scheduling on reconfigurable devices (Q462781) (← links)
- Variable neighbourhood search: methods and applications (Q970194) (← links)
- Variable neighbourhood search: Methods and applications (Q1029572) (← links)
- Simulated annealing for resource-constrained scheduling (Q1309982) (← links)
- Solving the resource-constrained project scheduling problem by a variable neighbourhood search. (Q1427560) (← links)
- Variable neighbourhood search and mathematical programming for just-in-time job-shop scheduling problem (Q1718383) (← links)
- Multi-neighborhood simulated annealing for the sports timetabling competition ITC2021 (Q2163749) (← links)
- Less is more: variable neighborhood search for integrated production and assembly in smart manufacturing (Q2215198) (← links)
- Construction of mixed covering arrays using a combination of simulated annealing and variable neighborhood search (Q2631238) (← links)
- Dynamic job shop scheduling using variable neighbourhood search (Q3163356) (← links)
- Simulated annealing for centralised resource-constrained multiproject scheduling to minimise the maximal cash flow gap under different payment patterns (Q6588469) (← links)
- Simulated annealing for balancing covariates (Q6617489) (← links)
