Pages that link to "Item:Q1186923"

The following pages link to On the minimization of the weighted number of tardy jobs with random processing times and deadline (Q1186923):

Displaying 11 items.

• 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)
• Exact algorithms for a generalization of the order acceptance and scheduling problem in a single-machine environment (Q709154) (← links)
• Job selection and sequencing on a single machine in a random environment (Q1310027) (← links)
• The stochastic single machine scheduling problem with earliness and tardiness costs (Q1333461) (← links)
• A production rescheduling expert simulation system (Q1577764) (← links)
• Dynamic scheduling of stochastic jobs on a single machine (Q1600933) (← links)
• Minimizing the expected number of tardy jobs when processing times are normally distributed (Q1612011) (← links)
• Two-machine no-wait flowshop scheduling problem with uncertain setup times to minimize maximum lateness (Q1715728) (← links)
• Optimal sequences in stochastic single machine shops (Q1919778) (← links)
• Algorithms for minimizing the number of tardy jobs for reducing production cost with uncertain processing times (Q2290196) (← links)