Pages that link to "Item:Q326506"
From MaRDI portal
The following pages link to Efficient approximation schemes for the maximum lateness minimization on a single machine with a fixed operator or machine non-availability interval (Q326506):
Displaying 8 items.
- Minimizing maximum delivery completion time for order scheduling with rejection (Q830938) (← links)
- Approximation schemes for minimizing the maximum lateness on a single machine with release times under non-availability or deadline constraints (Q1799225) (← links)
- Minimizing total weighted late work on a single-machine with non-availability intervals (Q2165284) (← links)
- An improved semi-online algorithm for scheduling on a single machine with unexpected breakdown (Q2185825) (← links)
- Single-machine scheduling with operator non-availability to minimize total weighted completion time (Q2195317) (← links)
- Best possible algorithms for online scheduling on identical batch machines with periodic pulse interruptions (Q6112735) (← links)
- Single machine scheduling with rejection and a non-availability interval to minimize the maximum delivery completion time plus the total rejection cost (Q6542992) (← links)
- Minimizing the maximum lateness for scheduling with release times and job rejection (Q6646743) (← links)
