Ordinal algorithms for packing with target center of gravity

DOI10.1007/BF00383965MaRDI QIDQ1815847zbMATH OpenFDO

Authors Weiping Liu, Jeffrey B. Sidney

Publication date 19 November 1996

Published in Order (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BF00383965

zbMATH Keywords

heuristicoptimal permutationpacking algorithms

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Combinatorics in computer science (68R05)

Recommendations

• scientific article; zbMATH DE number 911856
• Bin packing using semi-ordinal data
• Online weight balancing on the unit circle
• An integer-programming-based heuristic for the balanced loading problem

Cited in

(8)

• Ordinal algorithms for parallel machine scheduling with nonsimultaneous machine available times
• Optimal on-line algorithms for the uniform machine scheduling problem with ordinal data
• \(\kappa\)-partitioning problems for maximizing the minimum load
• Ordinal algorithms for parallel machine scheduling
• Rearranging a sequence of points onto a line
• Bin packing using semi-ordinal data
• Online weight balancing on the unit circle
• Parallel solutions for ordinal scheduling with a small number of machines

This page was built for publication: Ordinal algorithms for packing with target center of gravity

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