Marten Maack

List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

Publication	Date of Publication	Type
Approximation schemes for machine scheduling	2024-09-17	Paper
Online cardinality constrained scheduling Operations Research Letters	2024-06-17	Paper
Cardinality constrained scheduling in online models	2024-04-23	Paper
Server cloud scheduling Algorithmica	2024-04-02	Paper
Online load balancing on uniform machines with limited migration Operations Research Letters	2023-07-03	Paper
Online bin covering with limited migration Journal of Computer and System Sciences	2023-03-10	Paper
scientific article; zbMATH DE number 7650890 (Why is no real title available?) (available as arXiv preprint)	2023-02-07	Paper
Empowering the configuration-IP: new PTAS results for scheduling with setup times Mathematical Programming. Series A. Series B	2022-10-24	Paper
Server cloud scheduling (available as arXiv preprint)	2022-10-19	Paper
scientific article; zbMATH DE number 7559087 (Why is no real title available?) (available as arXiv preprint)	2022-07-18	Paper
scientific article; zbMATH DE number 7559382 (Why is no real title available?) (available as arXiv preprint)	2022-07-18	Paper
Online Bin Covering with Limited Migration (available as arXiv preprint)	2022-05-11	Paper
Structural parameters for scheduling with assignment restrictions Theoretical Computer Science	2020-10-21	Paper
Makespan minimization on unrelated parallel machines with simple job-intersection structure and bounded job assignments Theoretical Computer Science	2020-01-29	Paper
Approximation schemes for machine scheduling with resource (in-)dependent processing times ACM Transactions on Algorithms	2019-11-25	Paper
Makespan minimization on unrelated parallel machines with simple job-intersection structure and bounded job assignments Combinatorial Optimization and Applications	2019-10-11	Paper
An EPTAS for scheduling on unrelated machines of few different types Algorithmica	2019-09-10	Paper
Approximation schemes for machine scheduling with resource (in-)dependent processing times Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms	2018-07-16	Paper
Estimating the makespan of the two-valued restricted assignment problem Algorithmica	2018-05-23	Paper
Estimating the makespan of the two-valued restricted assignment problem	2017-10-17	Paper
An EPTAS for scheduling on unrelated machines of few different types Lecture Notes in Computer Science	2017-09-22	Paper
Structural parameters for scheduling with assignment restrictions Lecture Notes in Computer Science	2017-07-21	Paper

Research outcomes over time

This page was built for person: Marten Maack