Polynomial time approximation schemes for general multiprocessor job shop scheduling
From MaRDI portal
Publication:4806605
DOI10.1016/S0196-6774(02)00248-1zbMath1036.68011OpenAlexW2071008186MaRDI QIDQ4806605
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
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