Pages that link to "Item:Q1296092"
From MaRDI portal
The following pages link to On a methodology for discrete-continuous scheduling (Q1296092):
Displaying 25 items.
- Heuristic approaches to discrete-continuous project scheduling problems to minimize the makespan (Q535306) (← links)
- Project scheduling with finite or infinite number of activity processing modes -- a survey (Q621683) (← links)
- Discrete-continuous project scheduling with discounted cash inflows and various payment models -- a review of recent results (Q744660) (← links)
- On the continuous working problem (Q917431) (← 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)
- A priority-rule method for project scheduling with work-content constraints (Q1046055) (← links)
- Discrete-continuous scheduling problems -- mean completion time results (Q1278310) (← links)
- Discrete-continuous scheduling to minimize the makespan for power processing rates of jobs (Q1293204) (← links)
- Local search metaheuristics for discrete-continuous scheduling problems (Q1296094) (← links)
- Approximation algorithms for some discrete-continuous scheduling problems (Q1332457) (← links)
- Minimization of mean flow time for some discrete-continuous scheduling problems (Q1368686) (← links)
- Tabu list management methods for a discrete-continuous scheduling problem (Q1600837) (← 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)
- A heuristic approach to allocating the continuous resource in discrete--continuous scheduling problems to minimize the makespan (Q1860373) (← links)
- Discrete and continuous-time formulations for dealing with break periods: preemptive and non-preemptive scheduling (Q1999390) (← links)
- Revenue sharing for resource transfer among projects (Q2027026) (← links)
- Makespan optimization in a single-machine scheduling problem with dynamic job ready times-complexity and algorithms (Q2255056) (← links)
- A unified view of parallel machine scheduling with interdependent processing rates (Q2286430) (← links)
- Discrete-continuous project scheduling with discounted cash flows - a tabu search approach (Q2468474) (← links)
- Scheduling malleable tasks with interdependent processing rates: comments and observations (Q2476250) (← links)
- Optimal scheduling of parallel machines with constrained resources (Q2575564) (← links)
- Structure vs. Efficiency of the Cross-Entropy Based Population Learning Algorithm for Discrete-Continuous Scheduling with Continuous Resource Discretisation (Q5023085) (← links)
- Scheduling of network tasks to minimize the consumed energy (Q6070417) (← links)
