We consider a natural generalization of classical scheduling problems to a setting in which using a time unit for processing a job causes some time-dependent cost, the time-of-use tariff, which must be paid in addition to the standard scheduling cost. We focus on preemptive single-machine...

Part I: Models and Methods for Planning in Logistics -- Autonomous Control of Logistics Processes – A Retrospective -- Explorable Uncertainty meets Decision-Making in Logistics -- Complex Networks in Manufacturing and Logistics: A Retrospect -- Recent Developments in Mathematical Traffic...

We consider the scheduling problem of minimizing the average-weighted completion time on identical parallel machines when jobs are arriving over time. For both the preemptive and the nonpreemptive setting, we show that straightforward extensions of Smith's ratio rule yield smaller competitive...