Polynomial time approximation schemes for general multiprocessor job shop scheduling

DOI10.1016/S0196-6774(02)00248-1zbMath1036.68011OpenAlexW2071008186MaRDI QIDQ4806605

Lorant Porkolab, Klaus Jansen

Publication date: 14 May 2003

Published in: Journal of Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0196-6774(02)00248-1

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (2)

Scheduling with conflicts: Online and offline algorithms ⋮ Grouping techniques for scheduling problems: simpler and faster

This page was built for publication: Polynomial time approximation schemes for general multiprocessor job shop scheduling