Single machine scheduling with few deadlines

DOI10.4230/LIPICS.IPEC.2023.24MaRDI QIDQ6926185zbMATH OpenFDO

Authors Klaus Heeger, Danny Hermelin, Dvir Shabtay

Publication date 24 September 2025

Copyright license Creative Commons Attribution 4.0 International

zbMATH Keywords

parameterized complexitysingle-machine schedulingweighted completion timetardy jobspseudopolynomial algorithms

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Parameterized complexity, tractability and kernelization (68Q27)

This page was built for publication: Single machine scheduling with few deadlines

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