MILP formulations and an iterated local search algorithm with tabu thresholding for the order batching problem (Q319040): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: TTT plots: a perl program to create time-to-target plots / rank
 
Normal rank
Property / cites work
 
Property / cites work: VARIABLE NEIGHBORHOOD SEARCH FOR ORDER BATCHING IN A WAREHOUSE / rank
 
Normal rank
Property / cites work
 
Property / cites work: Order batching in walk-and-pick order picking systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Design and control of warehouse order picking: a literature review / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient orderbatching methods in warehouses / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tabu Thresholding: Improved Search by Nonmonotonic Trajectories / rank
 
Normal rank
Property / cites work
 
Property / cites work: Research on warehouse operation: a comprehensive review / rank
 
Normal rank
Property / cites work
 
Property / cites work: Research on warehouse design and performance evaluation: a comprehensive review / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for on-line order batching in an order picking warehouse / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tabu search heuristics for the order batching problem in manual order picking systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Batch picking in narrow-aisle order picking systems with consideration for picker blocking / rank
 
Normal rank
Property / cites work
 
Property / cites work: Order-batching heuristics based on cluster analysis in a low-level picker-to-part warehousing system / rank
 
Normal rank
Property / cites work
 
Property / cites work: A similarity coefficient measure and machine-parts grouping in cellular manufacturing systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4452900 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fast simulated annealing method for batching precedence-constrained customer orders in a warehouse / rank
 
Normal rank
Property / cites work
 
Property / cites work: VLSN search algorithms for partitioning problems using matching neighbourhoods / rank
 
Normal rank
Property / cites work
 
Property / cites work: The quadratic minimum spanning tree problem: a lower bounding procedure and an efficient search algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: The savings algorithm for the vehicle routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Order-Picking in a Rectangular Warehouse: A Solvable Case of the Traveling Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Routing methods for warehouses with multiple cross aisles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Batch Construction Heuristics and Storage Assignment Strategies for Walk/Ride and Pick Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rich routing problems arising in supply chain management / rank
 
Normal rank

Revision as of 15:35, 12 July 2024

scientific article
Language Label Description Also known as
English
MILP formulations and an iterated local search algorithm with tabu thresholding for the order batching problem
scientific article

    Statements

    MILP formulations and an iterated local search algorithm with tabu thresholding for the order batching problem (English)
    0 references
    0 references
    6 October 2016
    0 references
    warehouse management
    0 references
    order batching problem
    0 references
    mixed integer linear programming
    0 references
    local search
    0 references
    0 references
    0 references
    0 references

    Identifiers