Pages that link to "Item:Q1600933"

The following pages link to Dynamic scheduling of stochastic jobs on a single machine (Q1600933):

Displaying 31 items.

• Modeling the dynamics of a multi-product manufacturing system: a real case application (Q319423) (← links)
• Scheduling with compressible and stochastic release dates (Q336364) (← links)
• Setting optimal due dates in a basic safe-scheduling model (Q336772) (← links)
• A survey of single machine scheduling to minimize weighted number of tardy jobs (Q380558) (← links)
• Minimizing total tardiness in a stochastic single machine scheduling problem using approximate dynamic programming (Q633553) (← links)
• Single machine scheduling under market uncertainty (Q856210) (← links)
• Minimizing the weighted number of early and tardy jobs in a stochastic single machine scheduling problem (Q872264) (← links)
• One machine scheduling to minimize expected mean tardiness. II (Q1332812) (← links)
• Dynamic non-preemptive single machine scheduling (Q1360133) (← links)
• Minimizing the expected number of tardy jobs when processing times are normally distributed (Q1612011) (← links)
• Distributionally robust single machine scheduling with risk aversion (Q1752194) (← links)
• Optimal stochastic single-machine-tardiness scheduling by stochastic branch-and-bound (Q1847179) (← links)
• A new rule for minimizing the number of tardy jobs in dynamic flow shops (Q1876177) (← links)
• Stochastic single machine scheduling problem as a multi-stage dynamic random decision process (Q2051165) (← links)
• Algorithms for minimizing the number of tardy jobs for reducing production cost with uncertain processing times (Q2290196) (← links)
• Bi-objective single machine scheduling problem with stochastic processing times (Q2343079) (← links)
• Trading off due-date tightness and job tardiness in a basic scheduling model (Q2356123) (← links)
• Minimizing earliness and tardiness costs in stochastic scheduling (Q2356252) (← links)
• Optimal static priority rules for stochastic scheduling with impatience (Q2376741) (← links)
• Safe scheduling: Setting due dates in single-machine problems (Q2378451) (← links)
• Stochastic scheduling to minimize expected maximum lateness (Q2482822) (← links)
• Solving a stochastic single machine problem with initial idle time and quadratic objective (Q2655649) (← links)
• A simulation-optimization framework for generating dynamic dispatching rules for stochastic job shop with earliness and tardiness penalties (Q2669778) (← links)
• Stability of scheduling with random processing times on one machine (Q2880813) (← links)
• (Q2955017) (← links)
• (Q3624015) (← links)
• Heavy Traffic Analysis of Dynamic Cyclic Policies: A Unified Treatment of the Single Machine Scheduling Problem (Q3634999) (← links)
• On a “No Arrivals” Heuristic for Single Machine Stochastic Scheduling (Q3991330) (← links)
• Ready-Time Scheduling with Stochastic Service Times (Q4393125) (← links)
• Un ordonnancement dynamique de tâches stochastiques sur un seul processeur (Q4457894) (← links)
• MULTIPLE SERVER PREEMPTIVE SCHEDULING WITH IMPATIENCE (Q5358113) (← links)