Two-machine routing open shop: How long is the optimal makespan?

DOI10.1007/978-3-030-77876-7_17MaRDI QIDQ2117636zbMATH OpenOpenAlexFDO

Authors Ilya Chernykh

Publication date 22 March 2022

Full work available at URL https://doi.org/10.1007/978-3-030-77876-7_17

zbMATH Keywords

efficient algorithminstance reductionrouting open shopoptima localizationstandard lower bound

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Recommendations

• 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
• Routing open shop with two nodes, unit processing times and equal number of jobs and machines
• On a routing open shop problem on two nodes with unit processing times
• On the optima localization for the three-machine routing open shop

Cites work

• scientific article; zbMATH DE number 3746840 (Why is no real title available?)
• scientific article; zbMATH DE number 3503127 (Why is no real title available?)
• scientific article; zbMATH DE number 1305102 (Why is no real title available?)
• A 6 5-approximation algorithm for the two-machine routing open-shop problem on a two-node network
• A historical note on the 3/2-approximation algorithm for the metric traveling salesman problem
• Efficient algorithms for the routing open shop with unrelated travel times on cacti
• Efficient approximation algorithms for the routing open shop problem
• On some properties of optimal schedules in the job shop problem with preemption and an arbitrary regular criterion
• On the optima localization for the three-machine routing open shop
• Open Shop Scheduling to Minimize Finish Time
• Optimal two- and three-stage production schedules with set-up time included
• The 2-Machine Routing Open Shop on a Triangular Transportation Network
• The routing open-shop problem on a network: complexity and approximation
• Two-machine routing open shop on a tree: instance reduction and efficiently solvable subclass

Cited in

(4)

• Approximation algorithms for two-machine proportionate routing open shop on a tree
• On the optima localization for the three-machine routing open shop
• Irreducible bin packing and normality in routing open shop
• Exponential tightness for integral-type functionals of centered independent differently distributed random variables

This page was built for publication: Two-machine routing open shop: How long is the optimal makespan?

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