Pages that link to "Item:Q1296094"
From MaRDI portal
The following pages link to Local search metaheuristics for discrete-continuous scheduling problems (Q1296094):
Displayed 10 items.
- Tabu search for discrete-continuous scheduling problems with heuristic continuous resource allocation (Q954934) (← links)
- Resource level minimization in the discrete-continuous scheduling (Q1043331) (← links)
- Discrete-continuous scheduling to minimize the makespan for power processing rates of jobs (Q1293204) (← links)
- On a methodology for discrete-continuous scheduling (Q1296092) (← links)
- Tabu list management methods for a discrete-continuous scheduling problem (Q1600837) (← links)
- Total completion time minimization for machine scheduling problem under time windows constraints with jobs' linear processing rate function (Q1652513) (← links)
- A heuristic approach to allocating the continuous resource in discrete--continuous scheduling problems to minimize the makespan (Q1860373) (← links)
- A survey of dynamic scheduling in manufacturing systems (Q2268515) (← links)
- Tight bounds for the identical parallel machine scheduling problem (Q3429035) (← links)
- Structure vs. Efficiency of the Cross-Entropy Based Population Learning Algorithm for Discrete-Continuous Scheduling with Continuous Resource Discretisation (Q5023085) (← links)