Efficient approximation algorithms for the routing open shop problem

We consider the routing open shop problem being a generalization of two classical discrete optimization problems: the open shop scheduling problem and the metric traveling salesman problem. The jobs are located at nodes of some transportation network, and the machines travel on the network to execut...

Full description

Saved in:

Bibliographic Details
Published in:	Computers & operations research Vol. 40; no. 3; pp. 841 - 847
Main Authors:	Chernykh, Ilya, Kononov, Alexander, Sevastyanov, Sergey
Format:	Journal Article
Language:	English
Published:	New York Elsevier Ltd 01.03.2013 Elsevier Pergamon Press Inc
Subjects:	Algorithms Approximation Approximation algorithm Computer networks Job shops Machine shops Mathematical analysis Mathematical problems Networks Optimization algorithms Route optimization Routing (machining) Routing (telecommunications) Routing open shop Studies Traveling salesman problem Worst-case analysis Approximation algorithm Worst-case analysis Routing open shop
ISSN:	0305-0548, 1873-765X, 0305-0548
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!