Optimal combinations of priority scheduling rules
From MaRDI portal
We consider the problem of optimal combinations of priority scheduling rules. A polynomial algorithm is proposed for finding an optimal combination of static priorities in the three-machine problem, polynomial algorithms with a bound are given for the m-machine problem, and some results concerning the choice of the set of static priorities are presented. It is shown that finding an optimal combination of dynamic priorities in a weighted one-machine problem is a polynomially complete problem.
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
Cited in
(7)- k-optimal solution sets for some polynomially solvable scheduling problems
- Synthesizing optimization algorithms for scheduling partially ordered set of problems
- Optimal priority assignment with hard constraint
- Technical Note—There are No Undiscovered Priority Index Sequencing Rules for Minimizing Total Delay Costs
- scientific article; zbMATH DE number 1293734 (Why is no real title available?)
- On a New Class of Combinatoric Optimizers for Multi-Product Single-Machine Scheduling
- Priority-based scheduling of mixed-critical jobs
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)
