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...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	Computers & operations research Ročník 40; číslo 3; s. 841 - 847
Hlavní autoři:	Chernykh, Ilya, Kononov, Alexander, Sevastyanov, Sergey
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	New York Elsevier Ltd 01.03.2013 Elsevier Pergamon Press Inc
Témata:	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
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Buďte první, kdo okomentuje tento záznam!