Bøger af Andreas Wiese

This book constitutes the refereed proceedings of the 21st International Workshop on Approximation and Online Algorithms, WAOA 2023, held in Amsterdam, The Netherlands, during September 7¿8, 2023The 16 full papers included in this book are carefully reviewed and selected from 43 submissions. The topics of WAOA 2023 were algorithmic game theory, algorithmic trading, coloring and partitioning, competitive analysis, computational advertising, computational finance, cuts and connectivity, FPT-approximation algorithms, geometric problems, graph algorithms, inapproximability results, mechanism design, network design, packing and covering, paradigms for the design and analysis of approximation and online algorithms, resource augmentation, and scheduling problems

Among the most important problems in combinatorial optimization are scheduling problems. In this paper, machine scheduling is considered. Usually in such problems a set of jobs and a set of machines are given. The task is to assign the jobs to the machines and to determine a schedule for each machine. The schedule determines at what times the machine will process the jobs assigned to it. Often, constraints must be taken into account. Typical constraints are times by which certain jobs must be completed (deadlines), that some jobs can only be processed when certain other jobs are completed (precedence constraints), or that some jobs are only available from a given time (release dates).