Pages that link to "Item:Q2174270"

The following pages link to Scheduling problems with controllable processing times and a common deadline to minimize maximum compression cost (Q2174270):

Displaying 10 items.

• Decomposition algorithms for submodular optimization with applications to parallel machine scheduling with controllable processing times (Q747774) (← links)
• Pre-emptive scheduling problems with controllable processing times (Q880501) (← links)
• Preemptive scheduling on uniform parallel machines with controllable job processing times (Q930610) (← links)
• Scheduling two agents with controllable processing times (Q976351) (← links)
• Notes on max flow time minimization with controllable processing times (Q1422222) (← links)
• A Review for Submodular Optimization on Machine Scheduling Problems (Q3297835) (← links)
• Scheduling to minimize the total compression and late costs (Q4381876) (← links)
• Theory and Applications of Models of Computation (Q5898864) (← links)
• Weighted throughput in a single machine preemptive scheduling with continuous controllable processing times (Q6042072) (← links)
• Single-machine scheduling of multiple projects with controllable processing times (Q6167669) (← links)