Pages that link to "Item:Q2195317"

The following pages link to Single-machine scheduling with operator non-availability to minimize total weighted completion time (Q2195317):

Displaying 10 items.

• Complexity and approximation of single machine scheduling with an operator non-availability period to minimize total completion time (Q497629) (← links)
• Operator non-availability periods (Q1041405) (← 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)
• 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)
• Single machine scheduling with non-availability interval and optional job rejection (Q2168742) (← links)
• Two-machine flow shop scheduling with an operator non-availability period to minimize makespan (Q2175049) (← links)
• Single machine scheduling with small operator-non-availability periods (Q2434272) (← links)
• Minimizing tardiness scheduling measures with generalized due-dates and a maintenance activity (Q6109346) (← 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)