Pages that link to "Item:Q2215197"
From MaRDI portal
The following pages link to A technical note: fully polynomial time approximation schemes for minimizing the makespan of deteriorating jobs with nonlinear processing times (Q2215197):
Displaying 4 items.
- Strongly polynomial FPTASes for monotone dynamic programs (Q2088581) (← links)
- Scheduling jobs with a V-shaped time-dependent processing time (Q2215205) (← links)
- Automatic Generation of FPTASes for Stochastic Monotone Dynamic Programs Made Easier (Q5013571) (← links)
- Exact algorithms and approximation schemes for proportionate flow shop scheduling with step-deteriorating processing times (Q6577340) (← links)