Bin packing using semi-ordinal data

DOI10.1016/0167-6377(96)00002-8zbMath0870.90072OpenAlexW1977695963WikidataQ126781416 ScholiaQ126781416MaRDI QIDQ2564622

Wei-Ping Liu, Jeffrey B. Sidney

Publication date: 15 September 1997

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0167-6377(96)00002-8

zbMATH Keywords

heuristic algorithmsbin packingworst case performance ratiorank-order data

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27)

Related Items (6)

\(\kappa\)-partitioning problems for maximizing the minimum load ⋮ Ordinal algorithms for parallel machine scheduling ⋮ Parallel solutions for ordinal scheduling with a small number of machines ⋮ Optimal on-line algorithms for the uniform machine scheduling problem with ordinal data ⋮ Semi-on-line scheduling with ordinal data on two uniform machines ⋮ Ordinal algorithms for parallel machine scheduling with nonsimultaneous machine available times

Cites Work

• No-wait flow shop scheduling with large lot sizes
• Ordinal algorithms for packing with target center of gravity
• Ordinal algorithms for parallel machine scheduling
• Unnamed Item
• Unnamed Item

This page was built for publication: Bin packing using semi-ordinal data