Bison: A fast hybrid procedure for exactly solving the one-dimensional bin packing problem
- 31 July 1997
- journal article
- Published by Elsevier BV in Computers & Operations Research
- Vol. 24 (7), 627-645
- https://doi.org/10.1016/s0305-0548(96)00082-2
Abstract
No abstract availableKeywords
This publication has 20 references indexed in Scilit:
- Maximizing the production rate in simple assembly line balancing — A branch and bound procedureEuropean Journal of Operational Research, 1996
- An exact algorithm for the dual bin packing problemOperations Research Letters, 1995
- Applying tabu search with influential diversification to multiprocessor schedulingComputers & Operations Research, 1994
- A branch-and-bound algorithm for the two-dimensional vector packing problemComputers & Operations Research, 1994
- Branch-and-bound algorithms for the multi-product assembly line balancing problemEuropean Journal of Operational Research, 1992
- A state-of-the-art review of parallel-machine scheduling researchEuropean Journal of Operational Research, 1990
- Lower bounds and reduction procedures for the bin packing problemDiscrete Applied Mathematics, 1990
- Using dual approximation algorithms for scheduling problems theoretical and practical resultsJournal of the ACM, 1987
- An algorithm for a class of loading problemsNaval Research Logistics Quarterly, 1978
- Approximation algorithms for combinatorial problemsJournal of Computer and System Sciences, 1974