Pages that link to "Item:Q954036"
From MaRDI portal
The following pages link to Approximation results for flow shop scheduling problems with machine availability constraints (Q954036):
Displaying 28 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)
- Single machine scheduling with semi-resumable machine availability constraints (Q655762) (← 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)
- Flow shops with machine maintenance: ordered and proportionate cases (Q992582) (← links)
- \(\frac{3}{2}\)-approximation for two-machine no-wait flowshop scheduling with availability constraints (Q1029003) (← links)
- Exponential inapproximability and FPTAS for scheduling with availability constraints (Q1029337) (← links)
- Approximability of flow shop scheduling (Q1290640) (← links)
- Two-machine flowshop scheduling with availability constraints (Q1296377) (← links)
- Approximability of two-machine no-wait flowshop scheduling with availability constraints. (Q1413925) (← 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)
- Open shop scheduling problem with a non-resumable flexible maintenance period (Q2150575) (← links)
- Two-machine flow shop scheduling with an operator non-availability period to minimize makespan (Q2175049) (← links)
- Improved approximation for non-preemptive single machine flow-time scheduling with an availability constraint (Q2371343) (← links)
- An improved approximation algorithm for two-machine flow shop scheduling with an availability constraint (Q2390265) (← links)
- Approximation guarantee of OSP mechanisms: the case of machine scheduling and facility location (Q2659777) (← links)
- Bi-objective optimization algorithms for joint production and maintenance scheduling under a global resource constraint: application to the permutation flow shop problem (Q2664314) (← links)
- Two-machine flow shop scheduling integrated with preventive maintenance planning (Q2795170) (← links)
- On-line and semi-online scheduling for flow shop problems on two machines (Q2841141) (← links)
- Two-machine flow shop problems with availability constraints (Q2887149) (← links)
- MAKESPAN MINIMIZATION WITH MACHINE AVAILABILITY CONSTRAINTS (Q3397506) (← links)
- Minimizing the makespan for the two-machine flow shop scheduling problem with random breakdown (Q6179225) (← links)
