O(log m)-approximation for the routing open shop problem

DOI10.1051/RO/2014051zbMath1310.90014OpenAlexW2045649834MaRDI QIDQ5247701

No author found.

Publication date: 27 April 2015

Published in: RAIRO - Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1051/ro/2014051

zbMATH Keywords

open shopapproximation algorithmsrouting

Mathematics Subject Classification ID

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

Related Items (6)

Complexity and approximation of open shop scheduling to minimize the makespan: a review of models and approaches ⋮ Two-machine routing open shop on a tree: instance reduction and efficiently solvable subclass ⋮ 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 ⋮ A new algorithm for the two-machine open shop and the polynomial solvability of a scheduling problem with routing

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Efficient approximation algorithms for the routing open shop problem
• The museum visitor routing problem
• Packet routing and job-shop scheduling in \(O\) (congestion + dilation) steps
• A \(\frac 6 5\)-approximation algorithm for the two-machine routing open-shop problem on a two-node network
• Fast algorithms for finding \(O\)(Congestion+Dilation) packet routing schedules
• The routing open-shop problem on a network: complexity and approximation
• Universal Packet Routing with Arbitrary Bandwidths and Transit Times
• Improved Approximation Algorithms for Routing Shop Scheduling
• The Routing Open Shop Problem: New Approximation Algorithms
• A constructive proof of the general lovász local lemma
• Open Shop Scheduling to Minimize Finish Time
• Improved Approximation Algorithms for Shop Scheduling Problems
• Short Shop Schedules
• A Simple Heuristic for m-Machine Flow-Shop and its Applications in Routing-Scheduling Problems
• On the routing open shop problem with two machines on a two-vertex network

This page was built for publication: O(log m)-approximation for the routing open shop problem