Pages that link to "Item:Q5059255"
From MaRDI portal
The following pages link to Fully polynomial-time approximation scheme for single machine scheduling with proportional-linear deteriorating jobs (Q5059255):
Displaying 8 items.
- A note on a fully polynomial-time approximation scheme for minimizing makespan of deteriorating jobs (Q474321) (← links)
- A fully polynomial approximation scheme for minimizing makespan of deteriorating jobs (Q1388066) (← links)
- Single-machine scheduling of proportional-linearly deteriorating jobs with positional due indices (Q2190797) (← links)
- An FPTAS for the weighted number of tardy jobs minimization on a single machine with deteriorating jobs (Q2628167) (← links)
- A Fully Polynomial Approximation Scheme for Single-Product Scheduling in a Finite Capacity Facility (Q3200871) (← links)
- A fully polynomial-time approximation scheme for total completion time minimization on a single machine with DeJong's learning effect and an availability constraint (Q5059405) (← links)
- An approximation algorithm for parallel machine scheduling with simple linear deterioration (Q5456305) (← links)
- Single-machine scheduling problems with job rejection, deterioration effects and past-sequence-dependent setup times (Q6094482) (← links)
