An exact solution with an improved running time for the routing flow shop problem with two machines
Year of publication: |
2024
|
---|---|
Authors: | Chernykh, Ilya ; Kononov, Alexander ; Sevastyanov, Sergey |
Published in: |
Journal of scheduling : JOS. - Dordrecht [u.a.] : Springer Science + Business Media, ISSN 1099-1425, ZDB-ID 2012329-2. - Vol. 27.2024, 4, p. 329-340
|
Subject: | Artificial Intelligence | Dynamic programming | Polynomially solvable case | Routing flow shop | Scheduling | Scheduling-Verfahren | Scheduling problem | Tourenplanung | Vehicle routing problem | Künstliche Intelligenz | Artificial intelligence | Theorie | Theory | Dynamische Optimierung | Durchlaufzeit | Lead time |
-
Dynamic adjustment of dispatching rule parameters in flow shops with sequence-dependent set-up times
Heger, Jens, (2016)
-
Scheduling with periodic availability constraints to minimize makespan
Yu, Lishi, (2024)
-
Single machine scheduling with step-learning
Atsmony, Matan, (2024)
- More ...
-
Efficient approximation algorithms for the routing open shop problem
Chernykh, Ilya, (2013)
-
A complete 4-parametric complexity classification of short shop scheduling problems
Kononov, Alexander, (2012)
-
Integer preemptive scheduling on parallel machines
Baptiste, Philippe, (2012)
- More ...