On the complexity of non-preemptive shop scheduling with two jobs

DOI10.1007/s00607-002-1455-zzbMath1008.90019OpenAlexW1563263887MaRDI QIDQ1849563

Tamás Kis

Publication date: 1 December 2002

Published in: Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00607-002-1455-z

zbMATH Keywords

computational complexitypseudo-polynomial time algorithmmixed shop scheduling

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (2)

Two-machine job-shop scheduling with one joint job ⋮ Scheduling three chains on two parallel machines

This page was built for publication: On the complexity of non-preemptive shop scheduling with two jobs