Pages that link to "Item:Q1860373"
From MaRDI portal
The following pages link to A heuristic approach to allocating the continuous resource in discrete--continuous scheduling problems to minimize the makespan (Q1860373):
Displaying 16 items.
- Power-aware scheduling of preemptable jobs on identical parallel processors to meet deadlines (Q439457) (← links)
- Heuristic approaches to discrete-continuous project scheduling problems to minimize the makespan (Q535306) (← links)
- Power-aware scheduling of preemptable jobs on identical parallel processors to minimize makespan (Q744652) (← links)
- Discrete-continuous project scheduling with discounted cash inflows and various payment models -- a review of recent results (Q744660) (← links)
- Evolutionary hybrid approaches for generation scheduling in power systems (Q857349) (← links)
- 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 problems -- mean completion time results (Q1278310) (← links)
- On a methodology for discrete-continuous scheduling (Q1296092) (← links)
- Local search metaheuristics for discrete-continuous scheduling problems (Q1296094) (← links)
- Minimization of mean flow time for some discrete-continuous scheduling problems (Q1368686) (← links)
- Scheduling shared continuous resources on many-cores (Q1617293) (← links)
- Total completion time minimization for machine scheduling problem under time windows constraints with jobs' linear processing rate function (Q1652513) (← links)
- Production, maintenance and resource scheduling: a review (Q2098022) (← links)
- Discrete-continuous project scheduling with discounted cash flows - a tabu search approach (Q2468474) (← links)
- An heuristic approach for solving OSSP with a objective of minimizing total completion time and resource idleness (Q6051979) (← links)
