A Generalized Uniform Processor System

DOI10.1287/OPRE.33.2.346MaRDI QIDQ3714887zbMATH OpenOpenAlexFDO

Authors Teruo Masuda, Toshio Nishida, Hiroaki Ishii, Chip Martel

Publication date 1985

Published in Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/opre.33.2.346

zbMATH Keywords

optimal scheduleoptimal speed assignmentsoptimal speeds of processorsPolynomial algorithmspreemptive multiprocessor environment

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Recommendations

• scientific article; zbMATH DE number 1688367
• Preemptive Scheduling of Uniform Processor Systems
• Scheduling independent multiprocessor tasks on a uniform k-processor system
• On a special case of uniform processor scheduling
• Scheduling jobs on heterogeneous processors

Cited in

(15)

• Scheduling jobs on a single machine with release dates, delivery times and controllable processing times: Worst-case analysis
• Deterministic multiprocessor scheduling with multiple objectives
• An approximation algorithm for the \(m\)-machine permutation flow shop scheduling problem with controllable processing times
• An approximation algorithm for a single-machine scheduling problem with release times, delivery times and controllable processing times
• One machine scheduling problem with fuzzy duedates
• A note on scheduling on a single processor with speed dependent on a number of executed jobs
• Two machine mixed shop scheduling problem with controllable machine speeds
• The optimal control approach to generalized multiprocessor scheduling
• Models and algorithms for minimization of the cost of executing certain tasks in uniform multiprocessor computer systems
• A class of generalized multiprocessor scheduling problems
• A Review for Submodular Optimization on Machine Scheduling Problems
• Applications of Quadratic Programming
• Machine speed scaling by adapting methods for convex optimization with submodular constraints
• Scheduling with flexible resources in parallel workcenters to minimize maximum completion time
• A survey of results for sequencing problems with controllable processing times

This page was built for publication: A Generalized Uniform Processor System

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3714887)