Pages that link to "Item:Q4181574"

The following pages link to Scheduling Equal-Length Tasks Under Treelike Precedence Constraints to Minimize Maximum Lateness (Q4181574):

Displaying 29 items.

• Algorithms for scheduling with integer preemptions on parallel machines to minimize the maximum lateness (Q499334) (← links)
• A state-of-the-art review of parallel-machine scheduling research (Q919994) (← links)
• UET scheduling with unit interprocessor communication delays (Q1097163) (← links)
• k-optimal solution sets for some polynomially solvable scheduling problems (Q1121169) (← links)
• A branch-and-bound algorithm to solve the equal-execution-time job scheduling problem with precedence constraint and profile (Q1121783) (← links)
• Deadline scheduling of tasks with ready times and resource constraints (Q1255432) (← links)
• Identical parallel machines vs. unit-time shops and preemptions vs. chains in scheduling complexity (Q1399579) (← links)
• On the complexity of coordinated display of multimedia objects (Q1575545) (← links)
• On scheduling cycle shops: Classification, complexity and approximation (Q1600002) (← links)
• A survey on how the structure of precedence constraints may change the complexity class of scheduling problems (Q1617290) (← links)
• Scheduling UET-UCT outforests to minimize maximum lateness (Q1772849) (← links)
• Preemptive scheduling with variable profile, precedence constraints and due dates (Q1805445) (← links)
• Lower bounds on precedence-constrained scheduling for parallel processors. (Q1853033) (← links)
• A backward approach in list scheduling algorithms for multi-machine tardiness problems (Q1891242) (← links)
• Scheduling tree-like task systems with non-uniform deadlines subject to unit-length communication delays (Q1975378) (← 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)
• The worst-case analysis of the Garey-Johnson algorithm (Q2268512) (← links)
• The complexity of parallel machine scheduling of unit-processing-time jobs under level-order precedence constraints (Q2283293) (← links)
• Parallel machine problems with equal processing times: a survey (Q2434248) (← links)
• Effective iterative algorithms in scheduling theory (Q3714886) (← links)
• Open shop problems with unit time operations (Q4031970) (← links)
• NP-Complete operations research problems and approximation algorithms (Q4187586) (← links)
• On the Complexity of Scheduling to Optimize Average Response Time (Q4272552) (← links)
• Scheduling with precedence constraints: Worst-case analysis of priority algorithms (Q4709806) (← links)
• Scheduling Opposing Forests (Q4745255) (← links)
• PREEMPTIVE SCHEDULING ON PARALLEL PROCESSORS WITH DUE DATES (Q5716131) (← links)
• Performance of critical path type algorithms for scheduling on parallel processors (Q5949904) (← links)