Pages that link to "Item:Q2434272"
From MaRDI portal
The following pages link to Single machine scheduling with small operator-non-availability periods (Q2434272):
Displaying 9 items.
- Efficient approximation schemes for the maximum lateness minimization on a single machine with a fixed operator or machine non-availability interval (Q326506) (← links)
- High-multiplicity scheduling on one machine with forbidden start and completion times (Q341471) (← links)
- A binary multiple knapsack model for single machine scheduling with machine unavailability (Q342369) (← links)
- Complexity and approximation of single machine scheduling with an operator non-availability period to minimize total completion time (Q497629) (← links)
- Approximation schemes for minimizing the maximum lateness on a single machine with release times under non-availability or deadline constraints (Q1799225) (← links)
- A polynomial time algorithm for makespan minimization on one machine with forbidden start and completion times (Q1799381) (← links)
- Two-machine flow shop scheduling with an operator non-availability period to minimize makespan (Q2175049) (← links)
- Single-machine scheduling with operator non-availability to minimize total weighted completion time (Q2195317) (← links)
- Single-machine common due date total earliness/tardiness scheduling with machine unavailability (Q2286433) (← links)
