Pages that link to "Item:Q1814098"

The following pages link to Scheduling chain-structured tasks to minimize makespan and mean flow time (Q1814098):

Displaying 26 items.

• Scheduling chains to minimize mean flow time (Q290213) (← links)
• Scheduling results applicable to decision-theoretic troubleshooting (Q473374) (← links)
• `Strong'-`weak' precedence in scheduling: extensions to series-parallel orders (Q602755) (← links)
• Scheduling of uniform parallel machines with s-precedence constraints (Q646123) (← links)
• A best possible online algorithm for scheduling equal-length jobs on two machines with chain precedence constraints (Q714856) (← links)
• Online scheduling with chain precedence constraints of equal-length jobs on parallel machines to minimize makespan (Q721932) (← links)
• A fixed-parameter algorithm for scheduling unit dependent tasks on parallel machines with time windows (Q827589) (← links)
• An exact method for \(Pm/sds, r_{i}/ \sum^{n}_{i=1} C_{i}\) problem (Q875429) (← links)
• Scheduling of parallel machines to minimize total completion time subject to s-precedence constraints (Q955602) (← links)
• Scheduling three chains on two parallel machines (Q1040986) (← links)
• Heuristics for unrelated machine scheduling with precedence constraints (Q1290706) (← links)
• Is a unit-job shop not easier than identical parallel machines? (Q1392555) (← links)
• Identical parallel machines vs. unit-time shops and preemptions vs. chains in scheduling complexity (Q1399579) (← links)
• How useful are preemptive schedules? (Q1413904) (← links)
• A survey on how the structure of precedence constraints may change the complexity class of scheduling problems (Q1617290) (← links)
• Polynomial time approximation algorithms for machine scheduling: Ten open problems (Q1806342) (← links)
• Scheduling of resource tasks (Q1809809) (← links)
• Integer preemptive scheduling on parallel machines (Q1939681) (← links)
• Precedence constrained scheduling to minimize sum of weighted completion times on a single machine (Q1961232) (← links)
• An EPTAS for scheduling fork-join graphs with communication delay (Q1998847) (← links)
• Ideal schedules in parallel machine settings (Q2029359) (← links)
• Makespan minimization with OR-precedence constraints (Q2059086) (← links)
• A metric approach for scheduling problems with minimizing the maximum penalty (Q2245804) (← links)
• How small are shifts required in optimal preemptive schedules? (Q2341389) (← links)
• The complexity of machine scheduling for stability with a single disrupted job (Q2488217) (← links)
• Integrality Property in Preemptive Parallel Machine Scheduling (Q3392940) (← links)