Optimal Sequencing of Two Equivalent Processors

DOI10.1137/0117070zbMath0205.48603OpenAlexW1973538756MaRDI QIDQ5605625

Keiken Ninomiya, Mamoru Fujii, Tadao Kasami

Publication date: 1969

Published in: SIAM Journal on Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0117070

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Related Items

A state-space search approach for parallel processor scheduling problems with arbitrary precedence relations, A note on scheduling multiprocessor tasks with precedence constraints on parallel processors, A query-efficient quantum algorithm for maximum matching on general graphs, On two-processor scheduling and maximum matching in permutation graphs, The general maximum matching algorithm of Micali and Vazirani, Computing the bump number with techniques from two-processor scheduling, Unnamed Item, Scheduling unit-length jobs with precedence constraints of small height, UET-scheduling with chain-type precedence constraints, `Strong'-`weak' precedence in scheduling: extensions to series-parallel orders, Some problems in discrete optimization, Planar stage graphs: Characterizations and applications, The mutual exclusion scheduling problem for permutation and comparability graphs., Scheduling loosely connected task graphs., A survey of scheduling methods for multiprocessor systems, Normal-form preemption sequences for an open problem in scheduling theory, Parallel machine problems with equal processing times: a survey, Non-approximability of precedence-constrained sequencing to minimize setups., A state-of-the-art review of parallel-machine scheduling research, An efficient parallel algorithm for scheduling interval ordered tasks, A model for minimizing active processor time, Scheduling trees with large communication delays on two identical processors, Optimal shooting: Characterizations and applications, Precedence constrained scheduling in \((2-\frac{7}{3p+1})\) optimal, NP-complete scheduling problems, Optimal scheduling of homogeneous job systems, Polynomial time approximation algorithms for machine scheduling: Ten open problems, Solving the linear matroid parity problem as a sequence of matroid intersection problems, Upper bound of the duration of the shortest schedule in one class of Hu problems, Inhomogeneous graph sorting and job distribution between two processors, An efficient algorithm for finding ideal schedules, Optimal scheduling for two-processor systems, Scheduling Opposing Forests, Efficient maximum matching algorithms for trapezoid graphs, Optimal scheduling on parallel machines for a new order class, An efficient deterministic parallel algorithm for two processors precedence constraint scheduling