Pages that link to "Item:Q596452"

The following pages link to Scheduling malleable tasks on parallel processors to minimize the makespan (Q596452):

Displaying 16 items.

• Energetic reasoning and mixed-integer linear programming for scheduling with a continuous resource and linear efficiency functions (Q280177) (← links)
• Scheduling under a non-reversible energy source: an application of piecewise linear bounding of non-linear demand/cost functions (Q284842) (← links)
• An effective approximation algorithm for the malleable parallel task scheduling problem (Q433456) (← links)
• Heuristic approaches to discrete-continuous project scheduling problems to minimize the makespan (Q535306) (← links)
• A hybrid exact method for a scheduling problem with a continuous resource and energy constraints (Q890001) (← links)
• Resource level minimization in the discrete-continuous scheduling (Q1043331) (← links)
• Optimal workforce assignment to operations of a paced assembly line (Q1694335) (← links)
• Cumulative scheduling with variable task profiles and concave piecewise linear processing rate functions (Q1701239) (← links)
• Polyhedral results and valid inequalities for the continuous energy-constrained scheduling problem (Q1732114) (← links)
• Scheduling parallel jobs online with convex and concave parallelizability (Q1743115) (← links)
• Scheduling in-house transport vehicles to feed parts to automotive assembly lines (Q1753431) (← links)
• Packing-based branch-and-bound for discrete malleable task scheduling (Q2093190) (← links)
• Scheduling personnel for the build-up of unit load devices at an air cargo terminal with limited space (Q2197157) (← links)
• Scheduling malleable tasks with interdependent processing rates: comments and observations (Q2476250) (← links)
• Polyhedral Results and Branch-and-Cut for the Resource Loading Problem (Q4995060) (← links)
• Efficient approximation algorithms for scheduling moldable tasks (Q6113310) (← links)