On the intractability of preemptive single-machine job scheduling with release times, deadlines, and family setup times

DOI10.1016/J.IPL.2022.106305OpenAlexW4289780482WikidataQ114167062 ScholiaQ114167062MaRDI QIDQ2094381

Abhishek Singh

Publication date: 28 October 2022

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2022.106305

zbMATH Keywords

algorithmscomputational complexityschedulingsetup timesside-channel attacks

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Scheduling and fixed-parameter tractability
• Batch scheduling to minimize maximum lateness
• Parametrized complexity theory.
• Two-Processor Scheduling with Start-Times and Deadlines
• Complexity of Task Sequencing with Deadlines, Set-Up Times and Changeover Costs
• On the Complexity of Scheduling with Batch Setup Times
• Topics in Cryptology – CT-RSA 2006

This page was built for publication: On the intractability of preemptive single-machine job scheduling with release times, deadlines, and family setup times