Efficient heuristics for robot acquisition planning for a CIM system
From MaRDI portal
Publication:1908995
DOI10.1007/BF01719252zbMath0842.90094MaRDI QIDQ1908995
Publication date: 29 April 1996
Published in: OR Spektrum (Search for Journal in Brave)
greedy heuristictabu thresholdingtwo-dimensional bin packingsimulating annealingequipment acquisition planningmultiple-type robots
Related Items (2)
Strategies with memories: Local search in an application oriented environment. Applied local search -- a prologue ⋮ Metaheuristics: A bibliography
Cites Work
- Unnamed Item
- Unnamed Item
- Expected performance of the shelf heuristic for 2-dimensional packing
- Multidimensional on-line bin packing: Algorithms and worst-case analysis
- Lower bounds for on-line two-dimensional packing algorithms
- Packing problems
- Fast algorithms for bin packing
- The Bottomn-Left Bin-Packing Heuristic: An Efficient Implementation
- Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning
- Shelf Algorithms for Two-Dimensional Packing Problems
- An Exact Two-Dimensional Non-Guillotine Cutting Tree Search Procedure
- Two-dimensional packing: expected performance of simple level algorithms
- Performance Bounds for Level-Oriented Two-Dimensional Packing Algorithms
- Orthogonal Packings in Two Dimensions
- Performance Bounds for Orthogonal Oriented Two-Dimensional Packing Algorithms
- A algorithm for two-dimensional packing
- On Packing Two-Dimensional Bins
- Optimization by Simulated Annealing: An Experimental Evaluation; Part II, Graph Coloring and Number Partitioning
- Multidimensional Optimal Bin Packing with Items of Random Size
This page was built for publication: Efficient heuristics for robot acquisition planning for a CIM system
