Pages that link to "Item:Q2283293"

The following pages link to The complexity of parallel machine scheduling of unit-processing-time jobs under level-order precedence constraints (Q2283293):

Displaying 8 items.

• On the complexity of scheduling unit-time jobs with or-precedence constraints (Q813963) (← links)
• Identical parallel machines vs. unit-time shops and preemptions vs. chains in scheduling complexity (Q1399579) (← links)
• A survey on how the structure of precedence constraints may change the complexity class of scheduling problems (Q1617290) (← links)
• Scheduling unit-length jobs with precedence constraints of small height (Q1667212) (← links)
• Three notes on scheduling unit-length jobs with precedence constraints to minimize the total completion time (Q2066685) (← links)
• Scheduling lower bounds via AND subset sum (Q2121467) (← links)
• A complexity analysis of parallel scheduling unit-time jobs with in-tree precedence constraints while minimizing the mean flow time (Q2294894) (← links)
• Equitable scheduling on a single machine (Q6103750) (← links)