Pages that link to "Item:Q5946721"

The following pages link to A note on the complexity of family scheduling to minimize the number of late jobs (Q5946721):

Displaying 7 items.

• The single machine batching problem with identical family setup times to minimize maximum lateness is strongly NP-hard (Q856324) (← links)
• Customer order scheduling on a single machine with family setup times: complexity and algorithms (Q870129) (← links)
• The complexity of scheduling job families about a common due date (Q1376265) (← links)
• Strong NP-hardness of the single machine multi-operation jobs total completion time scheduling problem. (Q1853011) (← links)
• A survey of scheduling problems with setup times or costs (Q2467249) (← links)
• Pareto optimization scheduling of family jobs on a p-batch machine to minimize makespan and maximum lateness (Q2514124) (← links)
• A hybrid heuristic approach to minimize number of tardy jobs in group technology systems (Q6066616) (← links)