Routing Two-Machine Flowshop Problems on Networks with Special Structure

DOI10.1287/trsc.30.4.303zbMath0874.90104OpenAlexW2078747392MaRDI QIDQ4346443

Igor Averbakh, Oded Berman

Publication date: 9 September 1997

Published in: Transportation Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/trsc.30.4.303

zbMATH Keywords

makespantreestwo-machine flowshoptransportation networkcactusesrouting-scheduling

Mathematics Subject Classification ID

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

Related Items

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 ⋮ The traveling salesman problem with job-times (\textit{TSPJ}) ⋮ Routing open shop and flow shop scheduling problems ⋮ Irreducible bin packing and normality in routing open shop ⋮ The routing open-shop problem on a network: complexity and approximation ⋮ A \(\frac 6 5\)-approximation algorithm for the two-machine routing open-shop problem on a two-node network ⋮ Transporting jobs through a two‐machine open shop