Pages that link to "Item:Q1395372"
From MaRDI portal
The following pages link to Non-preemptive two-machine open shop scheduling with non-availability constraints (Q1395372):
Displayed 13 items.
- Complexity and approximation of single machine scheduling with an operator non-availability period to minimize total completion time (Q497629) (← links)
- Approximation schemes for parallel machine scheduling with availability constraints (Q642981) (← links)
- Single machine scheduling with semi-resumable machine availability constraints (Q655762) (← 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)
- Approximation results for flow shop scheduling problems with machine availability constraints (Q954036) (← links)
- Fully polynomial approximation schemes for a symmetric quadratic knapsack problem and its scheduling applications (Q973008) (← links)
- Exponential inapproximability and FPTAS for scheduling with availability constraints (Q1029337) (← links)
- Operator non-availability periods (Q1041405) (← links)
- Scheduling jobs with maintenance subject to load-dependent duration on a single machine (Q1664968) (← links)
- Order acceptance and scheduling with machine availability constraints (Q2255964) (← links)
- Single Machine Scheduling with an Operator Non-availability Period to Minimize Total Completion Time (Q3004670) (← links)
- MAKESPAN MINIMIZATION WITH MACHINE AVAILABILITY CONSTRAINTS (Q3397506) (← links)