Pages that link to "Item:Q2491771"

The following pages link to Parallel machine scheduling with a convex resource consumption function (Q2491771):

Displaying 22 items.

• Single machine scheduling with total tardiness criterion and convex controllable processing times (Q646664) (← links)
• Scheduling parallel CNC machines with time/cost trade-off considerations (Q875425) (← links)
• A tabu-search algorithm for scheduling jobs with controllable processing times on a single machine to meet due-dates (Q976008) (← links)
• Power-aware scheduling for makespan and flow (Q1041350) (← links)
• Total completion time minimization for machine scheduling problem under time windows constraints with jobs' linear processing rate function (Q1652513) (← links)
• Controllable processing times in project and production management: analysing the trade-off between processing times and the amount of resources (Q1666672) (← links)
• Approximation schemes for parallel machine scheduling with non-renewable resources (Q1698888) (← links)
• Approximation algorithms for the workload partition problem and applications to scheduling with variable processing times (Q1752203) (← links)
• Single-machine scheduling to minimize total convex resource consumption with a constraint on total weighted flow time (Q1761997) (← links)
• Solving multi-objective parallel machine scheduling problem by a modified NSGA-II (Q1788959) (← links)
• Minimizing total completion time in multiprocessor job systems with energy constraint (Q2117638) (← links)
• Single-machine scheduling with resource-dependent processing times and multiple unavailability periods (Q2142677) (← links)
• Speed scaling scheduling of multiprocessor jobs with energy constraint and makespan criterion (Q2149611) (← links)
• Complexity analysis of an assignment problem with controllable assignment costs and its applications in scheduling (Q2275933) (← links)
• A unified view of parallel machine scheduling with interdependent processing rates (Q2286430) (← links)
• Parallel machine scheduling with additional resources: notation, classification, models and solution methods (Q2356015) (← links)
• A survey of scheduling with controllable processing times (Q2381529) (← links)
• A branch and bound algorithm for scheduling jobs with controllable processing times on a single machine to meet due dates (Q2430605) (← links)
• A bicriteria approach to minimize the total weighted number of tardy jobs with convex controllable processing times and assignable due dates (Q2434249) (← links)
• Unrelated parallel machine scheduling problem with special controllable processing times and setups (Q2676390) (← links)
• Scheduling parallel dedicated machines with the speeding‐up resource (Q5393022) (← links)
• Two-machine flow shop scheduling with convex resource consumption functions (Q6097489) (← links)