About one algorithm for solving scheduling problem
From MaRDI portal
Recommendations
- Minimization of the maximal lateness for a single machine
- The Pareto-optimal set of the NP-hard problem of minimization of the maximum lateness for a single machine
- A scheme of approximation solution of problem 1 |r j|L max
- A general scheme for solving an NP-hard problem in the strong sense of the scheduling theory
- The solvable cases of a scheduling algorithm
Cites work
- scientific article; zbMATH DE number 3882159 (Why is no real title available?)
- scientific article; zbMATH DE number 3715288 (Why is no real title available?)
- scientific article; zbMATH DE number 3473265 (Why is no real title available?)
- Minimizing maximum lateness on one machine: computational experience and some applications
- Scheduling unit-time tasks with integer release times and deadlines
- Some simple scheduling algorithms
Cited in
(8)- A block approach for single-machine scheduling with release dates and due dates
- Tighter price of anarchy for selfish task allocation on selfish machines
- scientific article; zbMATH DE number 4089299 (Why is no real title available?)
- Minimization of the maximal lateness for a single machine
- The solvable cases of a scheduling algorithm
- A general scheme for solving an NP-hard problem in the strong sense of the scheduling theory
- Some new efficient methods to solve the \(n/1/r_ i/\sum{}T_ i\) scheduling problem
- Developing feasible and optimal schedules of jobs on one machine
This page was built for publication: About one algorithm for solving scheduling problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q748247)
