An asymmetric traveling salesman problem based matheuristic algorithm for flowshop group scheduling problem
Year of publication: |
2023
|
---|---|
Authors: | He, Xuan ; Pan, Quan Ke ; Gao, Liang ; Neufeld, Janis S. |
Published in: |
European journal of operational research : EJOR. - Amsterdam : Elsevier, ISSN 0377-2217, ZDB-ID 243003-4. - Vol. 310.2023, 2 (16.10.), p. 597-610
|
Subject: | Asymmetric traveling salesman | Branch-and-cut | Iterated greedy | Matheuristic | Scheduling | Scheduling-Verfahren | Scheduling problem | Tourenplanung | Vehicle routing problem | Rundreiseproblem | Travelling salesman problem | Theorie | Theory | Algorithmus | Algorithm | Heuristik | Heuristics |
-
Model of megalopolises in the tool path optimisation for CNC plate cutting machines
Čencov, Aleksandr Georgievič, (2018)
-
The travelling purchaser problem, with multiple stacks and deliveries : a branch-and-cut approach
Batista-Galván, María, (2013)
-
The bi-objective traveling purchaser problem with deliveries
Palomo-Martínez, Pamela J., (2019)
- More ...
-
He, Xuan, (2024)
-
Huang, Ying-Ying, (2023)
-
Li, Yingli, (2021)
- More ...