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

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

The open shop problem is under study with two machines and routing on a two-vertex network. This problem is NP-hard. We introduce an exact pseudopolynomial algorithm, propose a fully polynomial time approximation scheme for solving this problem, and consider some particular polynomially solvable cas...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Journal of applied and industrial mathematics 2012-07, Vol.6 (3), p.318-331
1. Verfasser: Kononov, A. V.
Format: Artikel
Sprache:eng
Schlagworte:
Algorithms
Applied mathematics
Approximation
Computer networks
Critical path
Job shops
Machine shops
Mathematical analysis
Mathematical models
Mathematics
Mathematics and Statistics
Networks
Operations research
Polynomials
Routing
Routing (machining)
Routing (telecommunications)
Studies
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:The open shop problem is under study with two machines and routing on a two-vertex network. This problem is NP-hard. We introduce an exact pseudopolynomial algorithm, propose a fully polynomial time approximation scheme for solving this problem, and consider some particular polynomially solvable cases.
ISSN:1990-4789
1990-4797
DOI:10.1134/S1990478912030064