Efficient heuristics for robot acquisition planning for a CIM system

DOI10.1007/BF01719252zbMATH Open0842.90094MaRDI QIDQ1908995FDOQ1908995

Jack S. Cook, Bernard T. Han

Publication date: 29 April 1996

Published in: OR Spektrum (Search for Journal in Brave)

zbMATH Keywords

greedy heuristictabu thresholdingtwo-dimensional bin packingsimulating annealingequipment acquisition planningmultiple-type robots

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Performance Bounds for Level-Oriented Two-Dimensional Packing Algorithms
• On Packing Two-Dimensional Bins
• An Exact Two-Dimensional Non-Guillotine Cutting Tree Search Procedure
• Optimization by Simulated Annealing: An Experimental Evaluation; Part II, Graph Coloring and Number Partitioning
• Lower bounds for on-line two-dimensional packing algorithms
• Fast algorithms for bin packing
• Shelf Algorithms for Two-Dimensional Packing Problems
• Orthogonal Packings in Two Dimensions
• A algorithm for two-dimensional packing
• Multidimensional on-line bin packing: Algorithms and worst-case analysis
• Packing problems
• The Bottomn-Left Bin-Packing Heuristic: An Efficient Implementation
• Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning
• Performance Bounds for Orthogonal Oriented Two-Dimensional Packing Algorithms
• Expected performance of the shelf heuristic for 2-dimensional packing
• Two-dimensional packing: expected performance of simple level algorithms
• Multidimensional Optimal Bin Packing with Items of Random Size

Cited In (2)

• Strategies with memories: Local search in an application oriented environment. Applied local search -- a prologue
• Metaheuristics: A bibliography

This page was built for publication: Efficient heuristics for robot acquisition planning for a CIM system

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1908995)