The following pages link to Hatem Hadda (Q336499):
Displaying 13 items.
- Exact resolution of the two-stage hybrid flow shop with dedicated machines (Q479265) (← links)
- 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)
- A (\(\frac {4}{3}\))-approximation algorithm for a special case of the two machine flow shop problem with several availability constraints (Q732786) (← links)
- An improved heuristic for two-machine flow shop scheduling with an availability constraint and nonresumable jobs (Q972619) (← links)
- On the optimality conditions of the two-machine flow shop problem (Q1754105) (← links)
- Approximation results for the two-machine job shop under limited machine availability (Q1788868) (← links)
- A note on the two-stage hybrid flow shop problem with dedicated machines (Q1926618) (← links)
- On the two-stage hybrid flow shop with dedicated machines (Q3194700) (← links)
- Méthode heuristique pour le problème de flow shop hybride avec machines dédiées (Q3644816) (← links)
- On the two-stage assembly flow shop problem (Q6592922) (← links)
