Pages that link to "Item:Q3156725"

The following pages link to An FPTAS for scheduling a two-machine flowshop with one unavailability interval (Q3156725):

Displaying 20 items.

• The two-stage assembly flow shop scheduling with an availability constraint: worst case analysis (Q483213) (← links)
• A PTAS for a particular case of the two-machine flow shop with limited machine availability (Q483257) (← links)
• An improved algorithm for the two machine flow shop problem with several availability constraints (Q607877) (← links)
• A polynomial-time approximation scheme for the two machine flow shop problem with several availability constraints (Q691393) (← links)
• 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)
• Approximation results for flow shop scheduling problems with machine availability constraints (Q954036) (← 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)
• Mixed integer programming formulations for two-machine flow shop scheduling with an availability constraint (Q1640598) (← links)
• Approximation results for the two-machine job shop under limited machine availability (Q1788868) (← 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)
• A polynomial-time approximation scheme for the two-machine flow shop scheduling problem with an availability constraint (Q2489279) (← links)
• Two-machine flow shop scheduling integrated with preventive maintenance planning (Q2795170) (← links)
• A fully polynomial time approximation scheme for makespan minimization problems on two machines with a fixed non-availability interval (Q4901463) (← links)
• Optimality of Jackson's permutations with respect to limited machine availability (Q5488246) (← links)
• Three-stage assembly flow shop scheduling problem with a fixed maintenance period (Q6542995) (← links)
• Scheduling with cardinality dependent unavailability periods (Q6565385) (← links)