Efficient heuristics for robot acquisition planning for a CIM system
type: Item
instance of: scholarly article
title: Efficient heuristics for robot acquisition planning for a CIM system
zbMATH Open document ID: 0842.90094
DOI: 10.1007/BF01719252
author: Jack S. Cook
author: Bernard T. Han
published in: OR Spektrum
publication date: 1996-04-29T00:00:00Z
Mathematics Subject Classification ID: 90C27
zbMATH DE Number: 853143
zbMATH Keywords: equipment acquisition planning
zbMATH Keywords: multiple-type robots
zbMATH Keywords: two-dimensional bin packing
zbMATH Keywords: greedy heuristic
zbMATH Keywords: tabu thresholding
zbMATH Keywords: simulating annealing
MaRDI profile type: Publication
cites work: Q3994799
cites work: A algorithm for two-dimensional packing
cites work: Orthogonal Packings in Two Dimensions
cites work: Shelf Algorithms for Two-Dimensional Packing Problems
cites work: Expected performance of the shelf heuristic for 2-dimensional packing
cites work: An Exact Two-Dimensional Non-Guillotine Cutting Tree Search Procedure
cites work: Lower bounds for on-line two-dimensional packing algorithms
cites work: The Bottomn-Left Bin-Packing Heuristic: An Efficient Implementation
cites work: On Packing Two-Dimensional Bins
cites work: Performance Bounds for Level-Oriented Two-Dimensional Packing Algorithms
cites work: Multidimensional on-line bin packing: Algorithms and worst-case analysis
cites work: Packing problems
cites work: Performance Bounds for Orthogonal Oriented Two-Dimensional Packing Algorithms
cites work: Two-dimensional packing: expected performance of simple level algorithms
cites work: Fast algorithms for bin packing
cites work: Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning
cites work: Optimization by Simulated Annealing: An Experimental Evaluation; Part II, Graph Coloring and Number Partitioning
cites work: Multidimensional Optimal Bin Packing with Items of Random Size
cites work: Q3809582
description: scientific article; zbMATH DE number 853143