A new algorithm for the two-machine open shop and the polynomial solvability of a scheduling problem with routing
Year of publication: |
2021
|
---|---|
Authors: | Khramova, Antonina P. ; Chernykh, Ilya |
Published in: |
Journal of scheduling : JOS. - Dordrecht [u.a.] : Springer Science + Business Media, ISSN 1099-1425, ZDB-ID 2012329-2. - Vol. 24.2021, 4, p. 405-412
|
Subject: | Open shop | Problems with transportation delays | Routing open shop | Unrelated travel times | Variable depot | Polynomially solvable subcases | Scheduling-Verfahren | Scheduling problem | Theorie | Theory | Tourenplanung | Vehicle routing problem | Algorithmus | Algorithm | Transportzeit | Travel time |
-
Wang, Dujuan, (2019)
-
Bakach, Iurii, (2018)
-
The time-dependent capacitated profitable tour problem with time windows and precedence constraints
Sun, Peng, (2018)
- More ...
-
The -machine flowshop problem with unit-time operations and intree precedence constraints
Averbakh, Igor, (2005)
-
A -approximation algorithm for the two-machine routing open-shop problem on a two-node network
Averbakh, Igor, (2005)
-
The routing open-shop problem on a network: Complexity and approximation
Averbakh, Igor, (2006)
- More ...