Pages that link to "Item:Q1885962"

The following pages link to Approximation schemes for parallel machine scheduling problems with controllable processing times (Q1885962):

Displaying 16 items.

• Minimizing total tardiness and earliness on unrelated parallel machines with controllable processing times (Q336752) (← links)
• An intelligent water drop algorithm to identical parallel machine scheduling with controllable processing times: a just-in-time approach (Q520264) (← links)
• Decomposition algorithms for submodular optimization with applications to parallel machine scheduling with controllable processing times (Q747774) (← links)
• Scheduling with tool changes to minimize total completion time under controllable machining conditions (Q868153) (← links)
• Scheduling parallel CNC machines with time/cost trade-off considerations (Q875425) (← links)
• Machine scheduling with resource dependent processing times (Q877194) (← links)
• Preemptive scheduling on uniform parallel machines with controllable job processing times (Q930610) (← links)
• Scheduling jobs with time-resource tradeoff via nonlinear programming (Q1040086) (← links)
• Approximation algorithms for the workload partition problem and applications to scheduling with variable processing times (Q1752203) (← links)
• Preemptive models of scheduling with controllable processing times and of scheduling with imprecise computation: a review of solution approaches (Q1754151) (← links)
• Scheduling problems with controllable processing times and a common deadline to minimize maximum compression cost (Q2174270) (← links)
• Optimal allocation and processing time decisions on non-identical parallel CNC machines: \(\epsilon\)-constraint approach (Q2371348) (← links)
• A survey of scheduling with controllable processing times (Q2381529) (← links)
• Unrelated parallel machine scheduling problem with special controllable processing times and setups (Q2676390) (← links)
• Scheduling unrelated parallel machine problem with multi-mode processing times and batch delivery cost (Q6105902) (← links)
• Preemptive scheduling of parallel jobs of two sizes with controllable processing times (Q6547139) (← links)