Weighted throughput in a single machine preemptive scheduling with continuous controllable processing times

DOI10.1007/s00236-022-00430-4OpenAlexW4286216668MaRDI QIDQ6042072

Tal Shusterman, Asaf Levin

Publication date: 16 May 2023

Published in: Acta Informatica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00236-022-00430-4

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• A dynamic programming algorithm for preemptive scheduling of a single machine to minimize the number of late jobs
• Single machine scheduling with discretely controllable processing times
• Preemptive models of scheduling with controllable processing times and of scheduling with imprecise computation: a review of solution approaches
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• Scheduling problems with controllable processing times and a common deadline to minimize maximum compression cost
• A survey of scheduling with controllable processing times
• Scheduling to minimize the total compression and late costs
• Multicriteria Optimization
• A Functional Equation and its Application to Resource Allocation and Sequencing Problems

This page was built for publication: Weighted throughput in a single machine preemptive scheduling with continuous controllable processing times