MILP formulations and an Iterated Local Search Algorithm with Tabu Thresholding for the Order Batching Problem
Year of publication: |
2015
|
---|---|
Authors: | Öncan, Temel |
Published in: |
European journal of operational research : EJOR. - Amsterdam : Elsevier, ISSN 0377-2217, ZDB-ID 243003-4. - Vol. 243.2015, 1 (16.5.), p. 142-155
|
Subject: | Warehouse management | Order Batching Problem | Mixed Integer Linear Programming | Local search | Theorie | Theory | Lagermanagement | Mathematische Optimierung | Mathematical programming | Scheduling-Verfahren | Scheduling problem | Auftragsabwicklung | Order processing | Heuristik | Heuristics | Tourenplanung | Vehicle routing problem |
-
Variable neighborhood search strategies for the order batching problem
Menéndez, Borja, (2017)
-
Coruzzolo, Antonio Maria, (2023)
-
Dynamics between warehouse operations and vehicle routing
Rijal, Arpan, (2023)
- More ...
-
Exact solution procedures for the balanced unidirectional cyclic layout problem
Öncan, Temel, (2008)
-
A tabu search heuristic for the generalized minimum spanning tree problem
Öncan, Temel, (2008)
-
A tabu search heuristic for the generalized minimum spanning tree problem
Öncan, Temel, (2008)
- More ...