A DSS based on optimizer tools and MTS meta-heuristic for the warehousing problem with conflicts

DOI10.1016/j.ipl.2018.02.001zbMath1476.90172OpenAlexW2792087285MaRDI QIDQ1708260

Saoussen Krichen, Sihem Ben Jouida

Publication date: 5 April 2018

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2018.02.001

zbMATH Keywords

bin packing problemapproximation algorithmstabu-search algorithmbin packing problem with conflictwarehousing problem

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Discrete location and assignment (90B80) Approximation algorithms (68W25)

Related Items (1)

On the benchmark instances for the bin packing problem with conflicts

Uses Software

• VRP
• Tabu search

Cites Work

• Unnamed Item
• Unnamed Item
• Bin packing with ``largest in bottom constraint: tighter bounds and generalizations
• Approximation algorithms for time constrained scheduling
• Heuristics and lower bounds for the bin packing problem with conflicts
• Fast algorithms for bin packing
• A user's guide to tabu search
• Algorithms for the Bin Packing Problem with Conflicts
• Colorful Bin Packing
• Heuristics for determining the number of warehouses for storing non-compatible products
• Supply Chain Management and its Applications in Computer Science
• Distributed Approximation Algorithm for Resource Clustering
• New classes of fast lower bounds for bin packing problems

This page was built for publication: A DSS based on optimizer tools and MTS meta-heuristic for the warehousing problem with conflicts