Pages that link to "Item:Q498410"

The following pages link to Approximation algorithms for maximizing the weighted number of early jobs on a single machine with non-availability intervals (Q498410):

Displaying 9 items.

• Multitasking via alternate and shared processing: algorithms and complexity (Q284835) (← links)
• Fast approximation algorithms to minimize a special weighted flow-time criterion on a single machine with a non-availability interval and release dates (Q640300) (← links)
• Prioritized surgery scheduling in face of surgeon tiredness and fixed off-duty period (Q887888) (← links)
• Exponential inapproximability and FPTAS for scheduling with availability constraints (Q1029337) (← links)
• Two simple constant ratio approximation algorithms for minimizing the total weighted completion time on a single machine with a fixed non-availability interval (Q1042105) (← links)
• Single-machine serial-batching scheduling with a machine availability constraint, position-dependent processing time, and time-dependent set-up time (Q1679623) (← links)
• Weighted completion time minimization on a single-machine with a fixed non-availability interval: differential approximability (Q1941538) (← links)
• Minimizing total weighted late work on a single-machine with non-availability intervals (Q2165284) (← links)
• Improving the solution complexity of the scheduling problem with deadlines: A general technique (Q2954334) (← links)