Pages that link to "Item:Q4859027"

The following pages link to Task scheduling with precedence constraints to minimize the total completion time (Q4859027):

Displaying 13 items.

• Scheduling of parallel machines to minimize total completion time subject to s-precedence constraints (Q955602) (← links)
• An algorithm for minimizing setups in precedence constrained scheduling (Q1069848) (← links)
• An iterative algorithm for scheduling unit-times tasks with precedence constraints to minimise the maximum lateness (Q1265894) (← links)
• A state-space search approach for parallel processor scheduling problems with arbitrary precedence relations (Q1333456) (← links)
• Preemptive scheduling with availability constraints to minimize total weighted completion times (Q1772973) (← links)
• Preemptive scheduling with variable profile, precedence constraints and due dates (Q1805445) (← links)
• Precedence constrained scheduling to minimize sum of weighted completion times on a single machine (Q1961232) (← links)
• ECP: a novel clustering-based technique to schedule precedence constrained tasks on multiprocessor computing systems (Q2218451) (← links)
• Scheduling of tasks with effectiveness precedence constraints (Q2300636) (← links)
• Approximate Deadline-Scheduling with Precedence Constraints (Q3452812) (← links)
• TWO PRECEDENCE-RELATED TASK-SCHEDULING ALGORITHMS (Q3991029) (← links)
• (Q4996254) (← links)
• (Q5456411) (← links)