The routing open-shop problem on a network: complexity and approximation
From MaRDI portal
Publication:2496075
DOI10.1016/j.ejor.2005.01.034zbMath1109.90038OpenAlexW2042986090MaRDI QIDQ2496075
Igor Averbakh, Ilya Chernykh, Oded Berman
Publication date: 30 June 2006
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2005.01.034
Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)
Related Items
Exponential tightness for integral-type functionals of centered independent differently distributed random variables ⋮ 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 ⋮ On a routing Open Shop Problem on two nodes with unit processing times ⋮ The traveling salesman problem with job-times (\textit{TSPJ}) ⋮ Approximation algorithms for two-machine proportionate routing open shop on a tree ⋮ Routing open shop and flow shop scheduling problems ⋮ 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 ⋮ Parameterized complexity of machine scheduling: 15 open problems ⋮ Transporting jobs through a two‐machine open shop ⋮ A new algorithm for the two-machine open shop and the polynomial solvability of a scheduling problem with routing ⋮ O(log m)-approximation for the routing open shop problem ⋮ Two-machine routing open shop: How long is the optimal makespan?
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A heuristic for the two-machine open-shop scheduling problem with transportation times
- Vehicle scheduling on a tree with release and handling times
- Group technology approach to the open shop scheduling problem with batch setup times
- A \(\frac 6 5\)-approximation algorithm for the two-machine routing open-shop problem on a two-node network
- Two-machine shop scheduling problems with batch processing
- Two-machine open shop scheduling with special transportation times
- Open Shop Scheduling to Minimize Finish Time
- The Delivery Man Problem and Cumulative Matroids
- Routing Two-Machine Flowshop Problems on Networks with Special Structure
- A Simple Heuristic for m-Machine Flow-Shop and its Applications in Routing-Scheduling Problems
