Three-machine shop scheduling with partially ordered processing routes

DOI10.1057/PALGRAVE/JORS/2601329zbMath1059.90075OpenAlexW2074968551MaRDI QIDQ4656657

Natalia V. Shakhlevich, Inna G. Drobouchevitch, Vitaly A. Strusevich

Publication date: 14 March 2005

Full work available at URL: https://doi.org/10.1057/palgrave/jors/2601329

zbMATH Keywords

approximation algorithmworst-case analysisshop scheduling

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (1)

Complexity and approximation of open shop scheduling to minimize the makespan: a review of models and approaches

This page was built for publication: Three-machine shop scheduling with partially ordered processing routes