Pages that link to "Item:Q1837104"
From MaRDI portal
The following pages link to A polynomial time algorithm for a chance-constrained single machine scheduling problem (Q1837104):
Displayed 10 items.
- Analysis of a class of proxy problems (Q801816) (← links)
- An efficient algorithm for the parametric resource allocation problem (Q1058467) (← links)
- A class of nonseparable dynamic programming problems (Q1075255) (← links)
- Minimizing the expected weighted number of tardy jobs in stochastic flow shops (Q1096531) (← links)
- An \(\varepsilon\)-approximation scheme for combinatorial optimization problems with minimum variance criterion (Q1183333) (← links)
- A fully polynomial time approximation scheme for minimum cost-reliability ratio problems (Q1183334) (← links)
- General stochastic single-machine scheduling with regular cost functions (Q1381780) (← links)
- A parametric characterization and an \(\epsilon\)-approximation scheme for the minimization of a quasiconcave program (Q1821694) (← links)
- A polynomial-time algorithm for a nonconvex chance-constrained program under the normal approximation (Q2688910) (← links)
- Single Machine Stochastic Scheduling: Minimizing the Number of Tardy Jobs (Q4842698) (← links)