Parallel variable neighborhood search for the min-max order batching problem
Year of publication: |
May 2017
|
---|---|
Authors: | Menéndez, Borja ; Pardo, Eduardo G. ; Sánchez-Oro, Jesús ; Duarte, Abraham |
Published in: |
International transactions in operational research : ITOR ; a journal of the International Federation of Operational Research Societies (IFORS). - Oxford : Wiley, ISSN 0969-6016, ZDB-ID 1213721-2. - Vol. 24.2017, 3, p. 635-662
|
Subject: | min-max order batching problem | parallel variable neighborhood search | general variable neighborhood search | Scheduling-Verfahren | Scheduling problem | Theorie | Theory | Heuristik | Heuristics |
-
Krimi, Issam, (2024)
-
Two multi-start heuristics for the k-traveling salesman problem
Pandiri, Venkatesh, (2020)
-
Less is more : general variable neighborhood search for the capacitated modular hub location problem
Mikić, Marija, (2019)
- More ...
-
Variable neighborhood search strategies for the order batching problem
Menéndez, Borja, (2017)
-
General variable neighborhood search for the order batching and sequencing problem
Menéndez, Borja, (2017)
-
Parallel variable neighbourhood search strategies for the cutwidth minimization problem
Duarte, Abraham, (2016)
- More ...