The open shop problem with routing at a two-node network and allowed preemption

DOI10.1134/S199047891203009XzbMath1324.90020OpenAlexW2041992105MaRDI QIDQ5263775

I. D. Chernykh, Artem V. Pyatkin

Publication date: 17 July 2015

Published in: Journal of Applied and Industrial Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1134/s199047891203009x

zbMATH Keywords

NP-completenessopen shop problem with routingpreemption of the operations

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Transportation, logistics and supply chain management (90B06)

Related Items (5)

Complexity and approximation of open shop scheduling to minimize the makespan: a review of models and approaches ⋮ On a routing Open Shop Problem on two nodes with unit processing times ⋮ Four decades of research on the open-shop scheduling problem to minimize the makespan ⋮ Irreducible bin packing and normality in routing open shop ⋮ Completing Partial Schedules for Open Shop with Unit Processing Times and Routing

This page was built for publication: The open shop problem with routing at a two-node network and allowed preemption