A linear-time algorithm for a resource-dependent preemptive late-work scheduling problem

DOI10.1016/J.ORL.2026.107513MaRDI QIDQ7347071zbMATH OpenFDO

Authors Myoung-Ju Park, Byung-Cheon Choi, Min Hee Lee

Publication date 14 September 2026

Published in Operations Research Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.ORL.2026.107513

Mathematics Subject Classification ID

Operations research, mathematical programming (90-XX)

Cites work

• A preemptive single-machine scheduling problem with a late work criterion and convex resource consumption functions
• A survey of scheduling with controllable processing times
• Convex resource allocation for minimizing the makespan in a single machine with job release dates
• Minimizing the total weighted flow time in a single machine with controllable processing times
• Preemptive models of scheduling with controllable processing times and of scheduling with imprecise computation: a review of solution approaches
• Resource management in machine scheduling problems: a survey
• Single Machine Scheduling to Minimize Total Late Work
• Single Machine Scheduling to Minimize Total Weighted Late Work
• Single-machine scheduling with resource-dependent processing times and multiple unavailability periods

This page was built for publication: A linear-time algorithm for a resource-dependent preemptive late-work scheduling problem

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