Line search method for solving a non-preemptive strictly periodic scheduling problem

From MaRDI portal
Publication:310329

DOI10.1007/S10951-014-0389-6zbMATH Open1347.90048OpenAlexW2026964676MaRDI QIDQ310329FDOQ310329


Authors: Clément Pira, Christian Artigues Edit this on Wikidata


Publication date: 8 September 2016

Published in: Journal of Scheduling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10951-014-0389-6




Recommendations




Cites Work


Cited In (6)

Uses Software





This page was built for publication: Line search method for solving a non-preemptive strictly periodic scheduling problem

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