On a routing Open Shop Problem on two nodes with unit processing times

DOI10.33048/daio.2020.27.681zbMath1493.90064OpenAlexW4248956709MaRDI QIDQ5090158

Mikhail Golovachev, Artem V. Pyatkin

Publication date: 15 July 2022

Published in: Diskretnyi analiz i issledovanie operatsii (Search for Journal in Brave)

Full work available at URL: http://mathnet.ru/eng/da956

zbMATH Keywords

complexityschedulingpolynomial timeunit processing timemakespan boundrouting open shop problem

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Deterministic scheduling theory in operations research (90B35)

Cites Work

• Unnamed Item
• Complexity results for flow-shop and open-shop scheduling problems with transportation delays
• Edge-coloring bipartite multigraphs in \(O(E \log D)\) time
• A heuristic for the two-machine open-shop scheduling problem with transportation times
• A polynomial algorithm for the \([n/m/0,\;t_{ij}=1,\text{ tree}/C_{\max}\) open shop problem]
• A \(\frac 6 5\)-approximation algorithm for the two-machine routing open-shop problem on a two-node network
• Routing open shop with two nodes, unit processing times and equal number of jobs and machines
• The routing open-shop problem on a network: complexity and approximation
• An algorithm with parameterized complexity of constructing the optimal schedule for the routing open shop problem with unit execution times
• Transporting jobs through a two‐machine open shop
• Open Shop Scheduling to Minimize Finish Time
• Short Shop Schedules
• On the routing open shop problem with two machines on a two-vertex network
• The open shop problem with routing at a two-node network and allowed preemption
• Completing Partial Schedules for Open Shop with Unit Processing Times and Routing