Algorithms and Computation

DOI10.1007/11602613zbMath1175.90172OpenAlexW2304246803MaRDI QIDQ5897924

No author found.

Publication date: 14 November 2006

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11602613

zbMATH Keywords

makespanparallel machines schedulingfully polynomial approximation scheme

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation algorithms (68W25)

Related Items (2)

``Product partition and related problems of scheduling and systems reliability: computational complexity and approximation ⋮ A review of four decades of time-dependent scheduling: main results, new topics, and open problems

This page was built for publication: Algorithms and Computation