On a Routing Open Shop Problem on Two Nodes with Unit Processing Times

The Routing Open Shop Problem deals with jobs located in the nodes of an edge-weighted graph and machines that are initially in a special node called depot . The machines must process all jobs in arbitrary order so that each machine processes at most one job at any one time and each job is processed...

Full description

Saved in:
Bibliographic Details
Published in:Journal of applied and industrial mathematics 2020-08, Vol.14 (3), p.470-479
Main Authors: Golovachev, M. O., Pyatkin, A. V.
Format: Article
Language:English
Subjects:
Mathematics
Mathematics and Statistics
Citations: Items that this one cites
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:The Routing Open Shop Problem deals with jobs located in the nodes of an edge-weighted graph and machines that are initially in a special node called depot . The machines must process all jobs in arbitrary order so that each machine processes at most one job at any one time and each job is processed by at most one machine at any one time. The goal is to minimize the makespan; i.e., the time when the last machine returns to the depot. This problem is known to be NP-hard even for the two machines and the graph containing only two nodes. In this article we consider the particular case of the problem with a -node graph, unit processing time of each job, and unit travel time between every two nodes. The conjecture is made that the problem is polynomially solvable in this case; i.e., the makespan depends only on the number of machines and the loads of the nodes and can be calculated in time . We provide some new bounds on the makespan in the case of depending on the loads distribution.
ISSN:1990-4789
1990-4797
DOI:10.1134/S1990478920030060