Showing cs.DSShow all
2 papers · 1 filter
cs.DS2026
Compressing the Lawler-Moore Dynamic Program for Weighted Tardy Jobs
Klaus Jansen, Björn Schumacher, Corinna Wambsganz
The classic scheduling problem of minimizing the total weight of tardy jobs () asks for a schedule of jobs each with a processing time, weight, and due date on a…
cs.DS2025
Minimizing the Weighted Makespan with Restarts on a Single Machine
Aflatoun Amouzandeh, Klaus Jansen, Lis Pirotton +2
We consider the problem of minimizing the weighted makespan on a single machine with restarts. Restarts are similar to preemptions but weaker: a job can be interrupted, but then it…