Scheduling Tasks with Nonuniform Deadlines on Two Processors
From MaRDI portal
Cited in
(34)- k-optimal solution sets for some polynomially solvable scheduling problems
- Complexity results for scheduling chains on a single machine
- Solving the resource constrained deadline scheduling problem via reduction to the network flow problem
- Simple algorithms for multiprocessor scheduling to meet deadlines
- Deadline scheduling of tasks with ready times and resource constraints
- An iterative algorithm for scheduling UET tasks with due dates and release times.
- Normal-form preemption sequences for an open problem in scheduling theory
- Scheduling UET-UCT outforests to minimize maximum lateness
- Discrete optimization with polynomially detectable boundaries and restricted level sets
- Scheduling tree-like task systems with non-uniform deadlines subject to unit-length communication delays
- Scheduling with or without precedence relations on a serial-batch machine to minimize makespan and maximum cost
- Performance of Garey-Johnson algorithm for pipelined typed tasks systems
- Scheduling multiprocessor tasks on two parallel processors
- Effective iterative algorithms in scheduling theory
- A survey of single machine scheduling to minimize weighted number of tardy jobs
- Inhomogeneous graph sorting and job distribution between two processors
- Open shop problems with unit time operations
- NP-Complete operations research problems and approximation algorithms
- Approximation scheduling algorithms: a survey
- On the Complexity of Scheduling to Optimize Average Response Time
- Scheduling Opposing Forests
- Algorithms for scheduling with integer preemptions on parallel machines to minimize the maximum lateness
- PREEMPTIVE SCHEDULING ON PARALLEL PROCESSORS WITH DUE DATES
- Performance of critical path type algorithms for scheduling on parallel processors
- Minimizing the number of tardy jobs with precedence constraints and agreeable due dates
- Scheduling UET-UCT tasks: Branch-and-bound search in the priority space
- Scheduling interval ordered tasks with non-uniform deadlines
- An efficient parallel algorithm for scheduling interval ordered tasks
- Minimizing the number of tardy jobs in single machine sequencing
- An improved discrete optimisation procedure with comparison to constraint programming
- An efficient algorithm for finding ideal schedules
- On the complexity of scheduling unit-time jobs with or-precedence constraints
- A state-of-the-art review of parallel-machine scheduling research
- Precedence constrained scheduling in \((2-\frac{7}{3p+1})\) optimal
This page was built for publication: Scheduling Tasks with Nonuniform Deadlines on Two Processors
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4105798)
