Pages that link to "Item:Q955602"

The following pages link to Scheduling of parallel machines to minimize total completion time subject to s-precedence constraints (Q955602):

Displaying 11 items.

• Minimizing total tardiness and earliness on unrelated parallel machines with controllable processing times (Q336752) (← links)
• Scheduling of uniform parallel machines with s-precedence constraints (Q646123) (← links)
• A priority rule for minimizing weighted flow time in a class of parallel machine scheduling problems (Q1310018) (← links)
• A state-space search approach for parallel processor scheduling problems with arbitrary precedence relations (Q1333456) (← links)
• Scheduling rules to minimize total tardiness in a parallel machine problem with setup and calendar constraints (Q1762106) (← links)
• Precedence constrained scheduling to minimize sum of weighted completion times on a single machine (Q1961232) (← links)
• Machine scheduling with soft precedence constraints (Q2282538) (← links)
• The complexity of parallel machine scheduling of unit-processing-time jobs under level-order precedence constraints (Q2283293) (← links)
• Approximation Bounds for a General Class of Precedence Constrained Parallel Machine Scheduling Problems (Q5470732) (← links)
• (Q5702311) (← links)
• Complexity of preemptive minsum scheduling on unrelated parallel machines (Q5704855) (← links)