Recent advances for a classical scheduling problem

DOI10.1007/978-3-642-39212-2_2MaRDI QIDQ5327418zbMATH OpenOpenAlexFDO

Authors 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

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

Recommendations

• Online scheduling on parallel machines: a survey
• A survey on makespan minimization in semi-online environments
• New algorithms for an ancient scheduling problem.

Cited in

(10)

• A survey on makespan minimization in semi-online environments
• An improved parametric algorithm on two-machine scheduling with given lower and upper bounds for the total processing time
• Semi-online scheduling: a survey
• Classifications, advances and prospects of scheduling games
• scientific article; zbMATH DE number 4031379 (Why is no real title available?)
• scientific article; zbMATH DE number 1487903 (Why is no real title available?)
• Online scheduling on parallel machines: a survey
• Minimizing the total completion time for a class of semi-online single machine scheduling problems
• Necessary and sufficient conditions of optimality for some classical scheduling problems
• An efficient algorithm for semi-online multiprocessor scheduling with given total processing time

This page was built for publication: Recent advances for a classical scheduling problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5327418)