Pages that link to "Item:Q4105798"
From MaRDI portal
The following pages link to Scheduling Tasks with Nonuniform Deadlines on Two Processors (Q4105798):
Displaying 34 items.
- A survey of single machine scheduling to minimize weighted number of tardy jobs (Q380558) (← links)
- A model for minimizing active processor time (Q487001) (← links)
- Algorithms for scheduling with integer preemptions on parallel machines to minimize the maximum lateness (Q499334) (← links)
- Scheduling UET-UCT tasks: Branch-and-bound search in the priority space (Q622602) (← links)
- An efficient parallel algorithm for scheduling interval ordered tasks (Q652455) (← links)
- Minimizing the number of tardy jobs in single machine sequencing (Q686166) (← links)
- An efficient algorithm for finding ideal schedules (Q766186) (← links)
- On the complexity of scheduling unit-time jobs with or-precedence constraints (Q813963) (← links)
- A state-of-the-art review of parallel-machine scheduling research (Q919994) (← links)
- Precedence constrained scheduling in \((2-\frac{7}{3p+1})\) optimal (Q955345) (← links)
- k-optimal solution sets for some polynomially solvable scheduling problems (Q1121169) (← links)
- Complexity results for scheduling chains on a single machine (Q1142687) (← links)
- Solving the resource constrained deadline scheduling problem via reduction to the network flow problem (Q1147628) (← links)
- Simple algorithms for multiprocessor scheduling to meet deadlines (Q1248336) (← links)
- Deadline scheduling of tasks with ready times and resource constraints (Q1255432) (← links)
- An iterative algorithm for scheduling UET tasks with due dates and release times. (Q1399585) (← links)
- Normal-form preemption sequences for an open problem in scheduling theory (Q1702732) (← links)
- Scheduling UET-UCT outforests to minimize maximum lateness (Q1772849) (← links)
- Discrete optimization with polynomially detectable boundaries and restricted level sets (Q1944392) (← links)
- Scheduling tree-like task systems with non-uniform deadlines subject to unit-length communication delays (Q1975378) (← links)
- Scheduling with or without precedence relations on a serial-batch machine to minimize makespan and maximum cost (Q2333219) (← links)
- Performance of Garey-Johnson algorithm for pipelined typed tasks systems (Q3002561) (← links)
- Scheduling multiprocessor tasks on two parallel processors (Q3148375) (← links)
- Effective iterative algorithms in scheduling theory (Q3714886) (← links)
- Inhomogeneous graph sorting and job distribution between two processors (Q3902471) (← links)
- Open shop problems with unit time operations (Q4031970) (← links)
- NP-Complete operations research problems and approximation algorithms (Q4187586) (← links)
- Approximation scheduling algorithms: a survey (Q4207781) (← links)
- On the Complexity of Scheduling to Optimize Average Response Time (Q4272552) (← 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)
- Minimizing the number of tardy jobs with precedence constraints and agreeable due dates (Q5961612) (← links)
- Scheduling interval ordered tasks with non-uniform deadlines (Q6487456) (← links)
