Recent Advances for a Classical Scheduling Problem

DOI10.1007/978-3-642-39212-2_2zbMath1334.68304OpenAlexW144089755MaRDI QIDQ5327418

Susanne Albers

Publication date: 7 August 2013

Published in: Automata, Languages, and Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-39212-2_2

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Online algorithms; streaming algorithms (68W27)

Related Items (4)

A survey on makespan minimization in semi-online environments ⋮ Semi-online scheduling: a survey ⋮ An efficient algorithm for semi-online multiprocessor scheduling with given total processing time ⋮ An improved parametric algorithm on two-machine scheduling with given lower and upper bounds for the total processing time

This page was built for publication: Recent Advances for a Classical Scheduling Problem