On the optima localization for the three-machine routing open shop

DOI10.1007/978-3-030-49988-4_19MaRDI QIDQ2663740zbMATH OpenOpenAlexFDO

Authors Ilya Chernykh, Olga Krivonogova

Publication date 19 April 2021

Full work available at URL https://doi.org/10.1007/978-3-030-49988-4_19

zbMATH Keywords

approximation algorithmcomputer-aided proofopen shopoptima localizationrouting open shop

Mathematics Subject Classification ID

Approximation algorithms (68W25) Deterministic network models in operations research (90B10) Deterministic scheduling theory in operations research (90B35) Abstract computational complexity for mathematical programming problems (90C60)

Recommendations

• How the difference in travel times affects the optima localization for the routing open shop
• Two-machine routing open shop: How long is the optimal makespan?
• The 2-Machine Routing Open Shop on a Triangular Transportation Network
• A 6 5-approximation algorithm for the two-machine routing open-shop problem on a two-node network
• The routing open-shop problem on a network: complexity and approximation

Cited in

(5)

• Two-machine routing open shop: How long is the optimal makespan?
• Four decades of research on the open-shop scheduling problem to minimize the makespan
• Irreducible bin packing and normality in routing open shop
• The 2-Machine Routing Open Shop on a Triangular Transportation Network
• scientific article; zbMATH DE number 1305102 (Why is no real title available?)

This page was built for publication: On the optima localization for the three-machine routing open shop

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2663740)