A theoretical framework to accelerate scheduling improvement heuristics using a new longest path algorithm in perturbed DAGs
Year of publication: |
2023
|
---|---|
Authors: | Madraki, Golshan ; Mousavian, Seyedamirabbas ; Salmani, Yasamin |
Published in: |
International journal of production research. - London [u.a.] : Taylor & Francis, ISSN 1366-588X, ZDB-ID 1485085-0. - Vol. 61.2023, 3, p. 818-838
|
Subject: | Directed acyclic graph | improvement heuristics | neighbourhood calculation | shop scheduling problem | the length of the longest path | Scheduling-Verfahren | Scheduling problem | Heuristik | Heuristics | Graphentheorie | Graph theory |
-
Assembly sequence planning based on a hybrid particle swarm optimisation and gentic algorithm
Xing, Yanfeng, (2012)
-
Thevenin, Simon, (2017)
-
Constrained min-cut replication for K-way hypergraph partitioning
Yazici, Volkan, (2014)
- More ...
-
Equilibria in investment and spot electricity markets : a conjectural-variations approach
Mousavian, Seyedamirabbas, (2020)
-
Salmani, Yasamin, (2021)
-
Salmani, Yasamin, (2018)
- More ...