Pages that link to "Item:Q2489279"

The following pages link to A polynomial-time approximation scheme for the two-machine flow shop scheduling problem with an availability constraint (Q2489279):

Displaying 18 items.

• Two-machine flow shop and open shop scheduling problems with a single maintenance window (Q724106) (← links)
• A (\(\frac {4}{3}\))-approximation algorithm for a special case of the two machine flow shop problem with several availability constraints (Q732786) (← links)
• An approximation scheme for two-machine flowshop scheduling with setup times and an availability constraint (Q878557) (← links)
• A pseudo-polynomial algorithm for a two-machine no-wait job-shop scheduling problem (Q915632) (← links)
• Approximation results for flow shop scheduling problems with machine availability constraints (Q954036) (← links)
• An improved heuristic for two-machine flow shop scheduling with an availability constraint and nonresumable jobs (Q972619) (← links)
• Flow shops with machine maintenance: ordered and proportionate cases (Q992582) (← links)
• Scheduling permutation flowshops with initial availability constraint: Analysis of solutions and constructive heuristics (Q1017464) (← links)
• A polynomial algorithm for the two machine job-shop scheduling problem with a fixed number of jobs (Q1326784) (← links)
• An improved heuristic for two-machine flowshop scheduling with an availability constraint (Q1591549) (← links)
• Mixed integer programming formulations for two-machine flow shop scheduling with an availability constraint (Q1640598) (← links)
• A PTAS for non-resumable open shop scheduling with an availability constraint (Q2125217) (← links)
• An improved approximation algorithm for two-machine flow shop scheduling with an availability constraint (Q2390265) (← 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)
• A Polynomial Approximation Scheme for a Constrained Flow-Shop Scheduling Problem (Q4294730) (← links)
• Complexity results and approximation algorithms for the two machine no-wait flow-shop with limited machine availability (Q4658386) (← links)
• A fully polynomial time approximation scheme for makespan minimization problems on two machines with a fixed non-availability interval (Q4901463) (← links)