Pages that link to "Item:Q2896382"

From MaRDI portal

← A Lower Bound on Deterministic Online Algorithms for Scheduling on Related Machines without Preemption (Q2896382)

Jump to:navigation, search

The following pages link to A Lower Bound on Deterministic Online Algorithms for Scheduling on Related Machines without Preemption (Q2896382):

Displaying 2 items.

Lower bounds for online makespan minimization on a small number of related machines (Q398887) (← links)
Tight upper bounds for semi-online scheduling on two uniform machines with known optimum (Q1642847) (← links)

Retrieved from "https://portal.mardi4nfdi.de/wiki/Special:WhatLinksHere/Item:Q2896382"