Optimal Sequencing of Two Equivalent Processors
From MaRDI portal
Cited in
(37)- The general maximum matching algorithm of Micali and Vazirani
- Computing the bump number with techniques from two-processor scheduling
- A survey of scheduling methods for multiprocessor systems
- NP-complete scheduling problems
- Optimal scheduling of homogeneous job systems
- Optimal scheduling on parallel machines for a new order class
- A state-space search approach for parallel processor scheduling problems with arbitrary precedence relations
- On two-processor scheduling and maximum matching in permutation graphs
- Planar stage graphs: Characterizations and applications
- The mutual exclusion scheduling problem for permutation and comparability graphs.
- Scheduling loosely connected task graphs.
- Non-approximability of precedence-constrained sequencing to minimize setups.
- Scheduling unit-length jobs with precedence constraints of small height
- Normal-form preemption sequences for an open problem in scheduling theory
- Polynomial time approximation algorithms for machine scheduling: Ten open problems
- Solving the linear matroid parity problem as a sequence of matroid intersection problems
- An efficient deterministic parallel algorithm for two processors precedence constraint scheduling
- UET-scheduling with chain-type precedence constraints
- Parallel machine problems with equal processing times: a survey
- Scheduling trees with large communication delays on two identical processors
- Optimal scheduling for two-processor systems
- Non-preemptive profile scheduling and quasi-interval orders
- A note on scheduling multiprocessor tasks with precedence constraints on parallel processors
- Upper bound of the duration of the shortest schedule in one class of Hu problems
- Inhomogeneous graph sorting and job distribution between two processors
- Optimal shooting: Characterizations and applications
- Scheduling Opposing Forests
- Efficient maximum matching algorithms for trapezoid graphs
- Some problems in discrete optimization
- `Strong'-`weak' precedence in scheduling: extensions to series-parallel orders
- An efficient parallel algorithm for scheduling interval ordered tasks
- Resource leveling: complexity of a unit execution time two-processor scheduling variant and related problems
- Feasibility analysis of recurrent DAG tasks is \(\mathsf{PSPACE}\)-hard
- An efficient algorithm for finding ideal schedules
- A query-efficient quantum algorithm for maximum matching on general graphs
- 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: Optimal Sequencing of Two Equivalent Processors
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5605625)
