On the routing open shop problem with two machines on a two-vertex network

DOI10.1134/S1990478912030064MaRDI QIDQ5263766zbMATH OpenFDO

Authors

Publication date 17 July 2015

Published in Journal of Applied and Industrial Mathematics (Search for Journal in Brave)

zbMATH Keywords

routingapproximation schemeopen shop problemfully polynomial time

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Deterministic scheduling theory in operations research (90B35)

Recommendations

• The 2-Machine Routing Open Shop on a Triangular Transportation Network
• On a routing open shop problem on two nodes with unit processing times
• A 6 5-approximation algorithm for the two-machine routing open-shop problem on a two-node network
• A new algorithm for the two-machine open shop and the polynomial solvability of a scheduling problem with routing
• The routing open-shop problem on a network: complexity and approximation
• The open shop problem with routing at a two-node network and allowed preemption
• Two-machine routing open shop on a tree: instance reduction and efficiently solvable subclass
• Approximation algorithms for two-machine proportionate routing open shop on a tree
• Routing Two-Machine Flowshop Problems on Networks with Special Structure
• Routing open shop with two nodes, unit processing times and equal number of jobs and machines

Cited in

(19)

• 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
• The open shop problem with routing at a two-node network and allowed preemption
• Some properties of the total flow-time problem of two machine open-shop
• The 2-Machine Routing Open Shop on a Triangular Transportation Network
• 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
• An exact solution with an improved running time for the routing flow shop problem with two machines
• A polynomial-time algorithm for the routing flow shop problem with two machines: an asymmetric network with a fixed number of nodes
• \(O(\log m)\)-approximation for the routing open shop problem
• The routing open-shop problem on a network: complexity and approximation
• On complexity of two-machine routing propotionate open shop
• A 3/2 algorithm for two-machine open shop with route-dependent processing times
• Sufficient conditions of polynomial solvability of the two-machine preemptive routing open shop on a tree
• On a routing open shop problem on two nodes with unit processing times
• Two-machine routing open shop on a tree: instance reduction and efficiently solvable subclass
• Routing open shop with two nodes, unit processing times and equal number of jobs and machines
• Exponential tightness for integral-type functionals of centered independent differently distributed random variables

This page was built for publication: On the routing open shop problem with two machines on a two-vertex network

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