Quick minimization of tardy processing time on a single machine

DOI10.1007/978-3-031-38906-1_42arXiv2301.05460OpenAlexW4385356976MaRDI QIDQ6139045

Baruch Schieber, Pranav Sitaraman

Publication date: 16 January 2024

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2301.05460

zbMATH Keywords

schedulingconvolutiontardy processing time

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx) Data structures (68P05)

Cites Work

• Unnamed Item
• Faster minimization of tardy processing time on a single machine
• Faster Pseudopolynomial Time Algorithms for Subset Sum
• A Functional Equation and its Application to Resource Allocation and Sequencing Problems

This page was built for publication: Quick minimization of tardy processing time on a single machine