Pages that link to "Item:Q972619"
From MaRDI portal
The following pages link to An improved heuristic for two-machine flow shop scheduling with an availability constraint and nonresumable jobs (Q972619):
Displaying 9 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)
- 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)
- Two-machine flow shop scheduling with an operator non-availability period to minimize makespan (Q2175049) (← 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)
