Pages that link to "Item:Q5059405"

The following pages link to 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):

Displaying 4 items.

• Minimizing the total completion time on a single machine with the learning effect and multiple availability constraints (Q727323) (← links)
• A polynomial-time approximation scheme for maximizing the minimum machine completion time (Q1362519) (← links)
• Machine scheduling with job rejection and Dejong's learning effect (Q6112831) (← links)
• A unified approach to single-machine scheduling with position-based processing times, machine availability, and job rejection (Q6544919) (← links)