The 2-Machine Routing Open Shop on a Triangular Transportation Network

DOI10.1007/978-3-319-44914-2_23MaRDI QIDQ3133222zbMATH OpenOpenAlexFDO

Authors Ilya Chernykh, Ekaterina Lgotina

Publication date 13 February 2018

Published in Discrete Optimization and Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-44914-2_23

zbMATH Keywords

schedulingrouting open shopoptima localization

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Recommendations

• On the routing open shop problem with two machines on a two-vertex network
• A 6 5-approximation algorithm for the two-machine routing open-shop problem on a two-node network
• On a routing open shop problem on two nodes with unit processing times
• The routing open-shop problem on a network: complexity and approximation
• On the optima localization for the three-machine routing open shop
• A 3/2 algorithm for two-machine open shop with route-dependent processing times
• The open shop problem with routing at a two-node network and allowed preemption
• Routing Two-Machine Flowshop Problems on Networks with Special Structure
• Approximation algorithms for two-machine proportionate routing open shop on a tree
• Routing open shop with two nodes, unit processing times and equal number of jobs and machines

Cited in

(15)

• A new algorithm for the two-machine open shop and the polynomial solvability of a scheduling problem with routing
• Approximation algorithms for two-machine proportionate routing open shop on a tree
• Two-machine routing open shop: How long is the optimal makespan?
• On the optima localization for the three-machine routing open shop
• On the routing open shop problem with two machines on a two-vertex network
• A 6 5-approximation algorithm for the two-machine routing open-shop problem on a two-node network
• How the difference in travel times affects the optima localization for the routing open shop
• Irreducible bin packing and normality in routing open shop
• Complexity and approximation of open shop scheduling to minimize the makespan: a review of models and approaches
• Four decades of research on the open-shop scheduling problem to minimize the makespan
• A polynomial-time algorithm for the routing flow shop problem with two machines: an asymmetric network with a fixed number of nodes
• On complexity of two-machine routing propotionate open shop
• Sufficient conditions of polynomial solvability of the two-machine preemptive routing open shop on a tree
• Two-machine routing open shop on a tree: instance reduction and efficiently solvable subclass
• Exponential tightness for integral-type functionals of centered independent differently distributed random variables

This page was built for publication: The 2-Machine Routing Open Shop on a Triangular Transportation Network

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