Optimal combinations of priority scheduling rules

zbMATH Open0613.90051MaRDI QIDQ1819702FDOQ1819702

Authors: A. I. Babushkin, I. S. Belov 

Publication date: 1986

Published in: Automation and Remote Control (Search for Journal in Brave)

Recommendations

• On the optimality of static priority policies in stochastic scheduling on parallel machines
• A survey of priority rule-based scheduling
• Optimal Scheduling of Jobs with Exponential Service Times on Identical Parallel Processors
• scientific article; zbMATH DE number 3873052
• Scheduling jobs on heterogeneous processors

zbMATH Keywords

polynomial algorithmoptimal combinations of priority scheduling

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Deterministic scheduling theory in operations research (90B35)

Cited In (7)

• Technical Note—There are No Undiscovered Priority Index Sequencing Rules for Minimizing Total Delay Costs
• Synthesizing optimization algorithms for scheduling partially ordered set of problems
• Title not available (Why is that?)
• k-optimal solution sets for some polynomially solvable scheduling problems
• Optimal priority assignment with hard constraint
• Priority-based scheduling of mixed-critical jobs
• On a New Class of Combinatoric Optimizers for Multi-Product Single-Machine Scheduling

This page was built for publication: Optimal combinations of priority scheduling rules

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