Pages that link to "Item:Q1799225"
From MaRDI portal
The following pages link to Approximation schemes for minimizing the maximum lateness on a single machine with release times under non-availability or deadline constraints (Q1799225):
Displaying 13 items.
- Efficient approximation schemes for the maximum lateness minimization on a single machine with a fixed operator or machine non-availability interval (Q326506) (← links)
- Approximation algorithms for no idle time scheduling on a single machine with release times and delivery times (Q496647) (← links)
- Minimizing maximum delivery completion time for order scheduling with rejection (Q830938) (← links)
- Approximation algorithms for single machine scheduling with one unavailability period (Q1022445) (← links)
- Algorithms for minimizing maximum lateness with unit length tasks and resource constraints (Q1803669) (← links)
- A branch and bound to minimize the number of late jobs on a single machine with release time constraints (Q1869685) (← links)
- Minimizing total weighted late work on a single-machine with non-availability intervals (Q2165284) (← links)
- Single machine scheduling with non-availability interval and optional job rejection (Q2168742) (← links)
- Bounds for naive multiple machine scheduling with release times and deadlines (Q3319773) (← links)
- A fully polynomial-time approximation scheme for total completion time minimization on a single machine with DeJong's learning effect and an availability constraint (Q5059405) (← links)
- Minimizing tardiness scheduling measures with generalized due-dates and a maintenance activity (Q6109346) (← links)
- A unified approach to single-machine scheduling with position-based processing times, machine availability, and job rejection (Q6544919) (← links)
- Minimizing the maximum lateness for scheduling with release times and job rejection (Q6646743) (← links)
