Pages that link to "Item:Q4901463"
From MaRDI portal
The following pages link to A fully polynomial time approximation scheme for makespan minimization problems on two machines with a fixed non-availability interval (Q4901463):
Displaying 9 items.
- Efficient approximation schemes for the maximum lateness minimization on a single machine with a fixed operator or machine non-availability interval (Q326506) (← links)
- Approximation schemes for parallel machine scheduling with availability constraints (Q642981) (← links)
- Approximation algorithms for the makespan minimization with positive tails on a single machine with a fixed non-availability interval (Q841595) (← links)
- Exponential inapproximability and FPTAS for scheduling with availability constraints (Q1029337) (← links)
- A polynomial-time approximation scheme for maximizing the minimum machine completion time (Q1362519) (← links)
- A polynomial-time approximation scheme for the two-machine flow shop scheduling problem with an availability constraint (Q2489279) (← links)
- An FPTAS for scheduling a two-machine flowshop with one unavailability interval (Q3156725) (← links)
- Polynomial-time approximation schemes for two-machine open shop scheduling with nonavailability constraints (Q3423261) (← links)
- Strongly Fully Polynomial Time Approximation Scheme for the weighted completion time minimization problem on two-parallel capacitated machines (Q4578168) (← links)
