Pages that link to "Item:Q535306"
From MaRDI portal
The following pages link to Heuristic approaches to discrete-continuous project scheduling problems to minimize the makespan (Q535306):
Displaying 12 items.
- Scheduling preemptable jobs on identical processors under varying availability of an additional continuous resource (Q328919) (← links)
- Discrete-continuous project scheduling with discounted cash inflows and various payment models -- a review of recent results (Q744660) (← links)
- A heuristic procedure for solving the dynamic probabilistic project expediting problem (Q948658) (← links)
- Solving the discrete-continuous project scheduling problem via its discretization (Q1401646) (← links)
- Scheduling shared continuous resources on many-cores (Q1617293) (← links)
- Resource-constrained project scheduling with flexible resource profiles in continuous time (Q1652311) (← links)
- Total completion time minimization for machine scheduling problem under time windows constraints with jobs' linear processing rate function (Q1652513) (← links)
- Revenue sharing for resource transfer among projects (Q2027026) (← links)
- An updated survey of variants and extensions of the resource-constrained project scheduling problem (Q2242185) (← links)
- Energetic reasoning for energy-constrained scheduling with a continuous resource (Q2356117) (← links)
- On a certain class of power- and energy-related scheduling problems (Q2422748) (← links)
- Comparative Analysis of Some Metaheuristics for Discrete-Continuous Project Scheduling with Activities of Identical Processing Rates (Q3188762) (← links)
