Pages that link to "Item:Q1799225"

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):

Displayed 5 items.

• Minimizing maximum delivery completion time for order scheduling with rejection (Q830938) ‎ (← 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)
• 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)