Pages that link to "Item:Q732786"

The following pages link to A (\(\frac {4}{3}\))-approximation algorithm for a special case of the two machine flow shop problem with several availability constraints (Q732786):

Displaying 8 items.

• Scheduling jobs with truncated exponential learning functions (Q395856) (← 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)
• A polynomial-time approximation scheme for the two machine flow shop problem with several availability constraints (Q691393) (← links)
• Single-machine scheduling with nonlinear deterioration (Q691413) (← links)
• Minimizing makespan in a two-machine flow shop with effects of deterioration and learning (Q694178) (← links)
• Approximation results for the two-machine job shop under limited machine availability (Q1788868) (← links)
• Optimal due-date assignment problem with learning effect and resource-dependent processing times (Q2439495) (← links)