Pages that link to "Item:Q1278310"

The following pages link to Discrete-continuous scheduling problems -- mean completion time results (Q1278310):

Displaying 11 items.

• On the continuous working problem (Q917431) (← links)
• Resource level minimization in the discrete-continuous scheduling (Q1043331) (← links)
• On the complexity of scheduling tasks with discrete starting times (Q1195868) (← links)
• On a methodology for discrete-continuous scheduling (Q1296092) (← links)
• Approximation algorithms for some discrete-continuous scheduling problems (Q1332457) (← links)
• Minimization of mean flow time for some discrete-continuous scheduling problems (Q1368686) (← links)
• Scheduling shared continuous resources on many-cores (Q1617293) (← links)
• Discrete and continuous-time formulations for dealing with break periods: preemptive and non-preemptive scheduling (Q1999390) (← links)
• Makespan optimization in a single-machine scheduling problem with dynamic job ready times-complexity and algorithms (Q2255056) (← links)
• The continuous assignment problem and its application to preemptive and non-preemptive scheduling with irregular cost functions (Q2890420) (← links)
• Theory and Applications of Models of Computation (Q5898864) (← links)