The open shop problem with routing at a two-node network and allowed preemption
From MaRDI portal
Publication:5263775
DOI10.1134/S199047891203009XzbMATH Open1324.90020OpenAlexW2041992105MaRDI QIDQ5263775FDOQ5263775
Authors: I. D. Chernykh, Artem 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
Recommendations
- Sufficient conditions of polynomial solvability of the two-machine preemptive routing open shop on a tree
- The routing open-shop problem on a network: complexity and approximation
- On the routing open shop problem with two machines on a two-vertex network
- Efficient approximation algorithms for the routing open shop problem
- Routing open shop with unrelated travel times
Programming involving graphs or networks (90C35) Transportation, logistics and supply chain management (90B06)
Cited In (9)
- Completing partial schedules for open shop with unit processing times and routing
- On the routing open shop problem with two machines on a two-vertex network
- The 2-Machine Routing Open Shop on a Triangular Transportation Network
- Irreducible bin packing and normality in routing open shop
- Complexity and approximation of open shop scheduling to minimize the makespan: a review of models and approaches
- Four decades of research on the open-shop scheduling problem to minimize the makespan
- On the two-machine routing open shop on a tree with preemption allowed
- Sufficient conditions of polynomial solvability of the two-machine preemptive routing open shop on a tree
- On a routing open shop problem on two nodes with unit processing times
This page was built for publication: The open shop problem with routing at a two-node network and allowed preemption
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5263775)
