The following pages link to Marten Maack (Q1751099):
Displayed 17 items.
- Estimating the makespan of the two-valued restricted assignment problem (Q1751100) (← links)
- Server cloud scheduling (Q2085746) (← links)
- Empowering the configuration-IP: new PTAS results for scheduling with setup times (Q2089776) (← links)
- Structural parameters for scheduling with assignment restrictions (Q2205947) (← links)
- Online bin covering with limited migration (Q2689369) (← links)
- Approximation schemes for machine scheduling with resource (in-)dependent processing times (Q4575688) (← links)
- Approximation Schemes for Machine Scheduling with Resource (In-)dependent Processing Times (Q4972675) (← links)
- Online Bin Covering with Limited Migration (Q5075753) (← links)
- (Q5089171) (← links)
- (Q5090421) (← links)
- Estimating The Makespan of The Two-Valued Restricted Assignment Problem (Q5369526) (← links)
- (Q5874275) (← links)
- Makespan minimization on unrelated parallel machines with simple job-intersection structure and bounded job assignments (Q5919347) (← links)
- An EPTAS for scheduling on unrelated machines of few different types (Q5919620) (← links)
- Makespan minimization on unrelated parallel machines with simple job-intersection structure and bounded job assignments (Q5919646) (← links)
- Online load balancing on uniform machines with limited migration (Q6106523) (← links)
- Server cloud scheduling (Q6130327) (← links)