Pages that link to "Item:Q2356252"

The following pages link to Minimizing earliness and tardiness costs in stochastic scheduling (Q2356252):

Displaying 9 items.

• The robust (minmax regret) single machine scheduling with interval processing times and total weighted completion time objective (Q342174) (← links)
• A clearing function based bid-price approach to integrated order acceptance and release decisions (Q1754318) (← links)
• Hybrid differential evolution optimisation for Earth observation satellite scheduling with time-dependent earliness-tardiness penalties (Q1992511) (← links)
• Due-window assignment scheduling problem with stochastic processing times (Q2029364) (← links)
• Non-indexability of the stochastic appointment scheduling problem (Q2188257) (← links)
• SINGLE MACHINE DUE DATE ASSIGNMENT SCHEDULING PROBLEM WITH PRECEDENCE CONSTRAINTS AND CONTROLLABLE PROCESSING TIMES IN FUZZY ENVIRONMENT (Q4626601) (← links)
• A stochastic approach for the single-machine scheduling problem to minimize total expected cost with client-dependent tardiness costs (Q6048180) (← links)
• An approximate dynamic programming approach for <scp>production‐delivery</scp> scheduling under non‐stationary demand (Q6051574) (← links)
• The effect of few historical data on the performance of sample average approximation method for operating room scheduling (Q6056096) (← links)