Bin packing using semi-ordinal data
From MaRDI portal
Publication:2564622
Recommendations
- Random-order bin packing
- A classification scheme for bin packing theory
- Best fit bin packing with random order revisited
- Best fit bin packing with random order revisited
- scientific article; zbMATH DE number 871933
- Incremental bin packing
- Batched bin packing revisited
- An O(n) bin-packing algorithm for uniformly distributed data
- Packing items into several bins facilitates approximating the separable assignment problem
Cites work
- scientific article; zbMATH DE number 3558962 (Why is no real title available?)
- scientific article; zbMATH DE number 2146482 (Why is no real title available?)
- No-wait flow shop scheduling with large lot sizes
- Ordinal algorithms for packing with target center of gravity
- Ordinal algorithms for parallel machine scheduling
Cited in
(7)- Ordinal algorithms for parallel machine scheduling with nonsimultaneous machine available times
- Optimal on-line algorithms for the uniform machine scheduling problem with ordinal data
- Ordinal algorithms for packing with target center of gravity
- \(\kappa\)-partitioning problems for maximizing the minimum load
- Ordinal algorithms for parallel machine scheduling
- Semi-on-line scheduling with ordinal data on two uniform machines
- Parallel solutions for ordinal scheduling with a small number of machines
This page was built for publication: Bin packing using semi-ordinal data
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2564622)
