About one algorithm for solving scheduling problem

DOI10.1134/S1995080215020171zbMath1328.90059OpenAlexW2201751427MaRDI QIDQ748247

N. K. Shcherbakova, O. N. Shulgina

Publication date: 20 October 2015

Published in: Lobachevskii Journal of Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1134/s1995080215020171

zbMATH Keywords

complexitypropertiesschedulinglatenessNP-completenesssequencingpseudopolynomial algorithm

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (1)

Tighter price of anarchy for selfish task allocation on selfish machines

Cites Work

• Scheduling unit-time tasks with integer release times and deadlines
• Minimizing maximum lateness on one machine: computational experience and some applications
• Some simple scheduling algorithms
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: About one algorithm for solving scheduling problem