Pages that link to "Item:Q3423261"
From MaRDI portal
The following pages link to Polynomial-time approximation schemes for two-machine open shop scheduling with nonavailability constraints (Q3423261):
Displaying 12 items.
- Two-machine flow shop and open shop scheduling problems with a single maintenance window (Q724106) (← links)
- A pseudo-polynomial algorithm for a two-machine no-wait job-shop scheduling problem (Q915632) (← links)
- A two-machine preemptive openshop scheduling problem: An elementary proof of NP-completeness (Q1280122) (← links)
- Non-preemptive two-machine open shop scheduling with non-availability constraints (Q1395372) (← links)
- A PTAS for non-resumable open shop scheduling with an availability constraint (Q2125217) (← links)
- Complexity and approximation of open shop scheduling to minimize the makespan: a review of models and approaches (Q2147068) (← links)
- Open shop scheduling problem with a non-resumable flexible maintenance period (Q2150575) (← links)
- Four decades of research on the open-shop scheduling problem to minimize the makespan (Q2239884) (← links)
- A fully polynomial time approximation scheme for scheduling on parallel identical two-stage openshops (Q2420659) (← links)
- A polynomial-time approximation scheme for the two-machine flow shop scheduling problem with an availability constraint (Q2489279) (← links)
- A dynamic programming algorithm for scheduling jobs in a two-machine open shop with an availability constraint (Q4656745) (← links)
- A fully polynomial time approximation scheme for makespan minimization problems on two machines with a fixed non-availability interval (Q4901463) (← links)
