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 2 items.
- 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)
- Single-machine scheduling problems with job rejection, deterioration effects and past-sequence-dependent setup times (Q6094482) (← links)