Pages that link to "Item:Q1591549"
From MaRDI portal
The following pages link to An improved heuristic for two-machine flowshop scheduling with an availability constraint (Q1591549):
Displaying 30 items.
- Single-machine scheduling with periodic maintenance to minimize makespan revisited (Q398924) (← links)
- The two-stage assembly flow shop scheduling with an availability constraint: worst case analysis (Q483213) (← 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)
- Heuristics for two-machine flowshop scheduling with setup times and an availability constraint (Q850314) (← 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)
- 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)
- Makespan minimization for two parallel machines scheduling with a periodic availability constraint (Q1000962) (← links)
- A note on ``scheduling of nonresumable jobs and flexible maintenance activities on a single machine to minimize makespan'' (Q1015007) (← links)
- Minimizing the makespan in the two-machine flowshop scheduling problem with an availability constraint (Q1362517) (← links)
- Minimizing the makespan for the flow shop scheduling problem with availability constraints. (Q1420378) (← links)
- Two-machine flowshop scheduling with consecutive availability constraints (Q1606963) (← links)
- Heuristics for two-machine no-wait flowshop scheduling with an availability constraint (Q1607139) (← links)
- Mixed integer programming formulations for two-machine flow shop scheduling with an availability constraint (Q1640598) (← links)
- An empirical analysis of heuristics for solving the two-machine flow shop problem with job release times (Q1761212) (← 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)
- Two-machine flow shop scheduling with an operator non-availability period to minimize makespan (Q2175049) (← links)
- An improved approximation algorithm for two-machine flow shop scheduling with an availability constraint (Q2390265) (← links)
- Worst-case analysis of the WSPT and MWSPT rules for single machine scheduling with one planned setup period (Q2467254) (← links)
- A polynomial-time approximation scheme for the two-machine flow shop scheduling problem with an availability constraint (Q2489279) (← links)
- Scheduling two-stage hybrid flow shop with availability constraints (Q2496033) (← links)
- Two-machine scheduling with periodic availability constraints to minimize makespan (Q2514681) (← links)
- Stability of Johnson's schedule with respect to limited machine availability (Q4706332) (← links)
- Optimality of Jackson's permutations with respect to limited machine availability (Q5488246) (← links)
- Improved approaches to minimize the makespan on single-machine scheduling with periodic preventive maintenance activities (Q6534463) (← links)
