Pages that link to "Item:Q3659513"

The following pages link to Note—On Baluts Algorithm and NP-Completeness for a Chance-Constrained Scheduling Problem (Q3659513):

Displaying 15 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)
• Minimizing the number of tardy jobs with stochastically-ordered processing times (Q835573) (← links)
• Minimizing the weighted number of early and tardy jobs in a stochastic single machine scheduling problem (Q872264) (← links)
• Minimizing the expected weighted number of tardy jobs in stochastic flow shops (Q1096531) (← links)
• On the minimization of the weighted number of tardy jobs with random processing times and deadline (Q1186923) (← links)
• The stochastic single machine scheduling problem with earliness and tardiness costs (Q1333461) (← links)
• General stochastic single-machine scheduling with regular cost functions (Q1381780) (← 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)
• Sequencing and due-date determination in the stochastic single machine problem with earliness and tardiness costs (Q1807950) (← links)
• A polynomial time algorithm for a chance-constrained single machine scheduling problem (Q1837104) (← links)
• Optimal sequences in stochastic single machine shops (Q1919778) (← links)
• Minimizing earliness and tardiness costs in stochastic scheduling (Q2356252) (← links)
• Single Machine Stochastic Scheduling: Minimizing the Number of Tardy Jobs (Q4842698) (← links)