Competivive Analysis of on-line Stack-Up Algorithms

No abstract is available for this paper.

• Publication year

  1997

• Venue

  Embedded Systems and Applications

• Publication date

  1997-09-15

• Fields of study

  Computer Science

• Identifiers
  DOI 10.1007/3-540-63397-9_31
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• An Approximation Algorithm for Stacking up Bins from a Conveyor onto Pallets

  1997cited by this paper
• Storage Controlled Pile-Up Systems, Theoretical Foundations

  1997cited by this paper
• Performance approximation of pick-to-belt orderpicking systems

  1994cited by this paper
• Sequencing and scheduling: algorithms and complexity

  1989cited by this paper
• Handbooks in operations research and management science

  1989cited by this paper
• Competitive algorithms for on-line problems

  1988cited by this paper
• An anomaly in space-time characteristics of certain programs running in a paging machine

  1969cited by this paper

• Stack-up algorithms for palletizing at delivery industry

  2001cites this paper
• An approximation algorithm for the stack-up problem

  2000cites this paper
• An Optimal Algorithm for On-Line Palletizing at Delivery Industry

  1998cites this paper
• An Approximation Algorithm for Stacking up Bins from a Conveyor onto Pallets

  1997cites this paper