Pages that link to "Item:Q633553"

The following pages link to Minimizing total tardiness in a stochastic single machine scheduling problem using approximate dynamic programming (Q633553):

Displaying 10 items.

• Iterated local search for single-machine scheduling with sequence-dependent setup times to minimize total weighted tardiness (Q398925) (← links)
• Dynamic programming and decomposition approaches for the single machine total tardiness problem (Q1092805) (← links)
• New heuristics for total tardiness minimization in a flexible flowshop (Q1947616) (← links)
• Stochastic single machine scheduling problem as a multi-stage dynamic random decision process (Q2051165) (← links)
• Approximate dynamic programming for an energy-efficient parallel machine scheduling problem (Q2140360) (← links)
• Analysis of computer job control under uncertainty (Q2263387) (← links)
• The single-machine absolute-deviation early-tardy problem with random completion times (Q4883172) (← 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)
• A simulation-based approximate dynamic programming approach to dynamic and stochastic resource-constrained multi-project scheduling problem (Q6554641) (← links)