Bin covering algorithms in the second stage of the lot to order matching problem
From MaRDI portal
Publication:4658513
DOI10.1057/palgrave.jors.2601222zbMath1181.90164MaRDI QIDQ4658513
John W. Fowler, W. Matthew Carlyle, Kraig R. Knutson
Publication date: 16 March 2005
Published in: Journal of the Operational Research Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1057/palgrave.jors.2601222
90C05: Linear programming
90C59: Approximation methods and heuristics in mathematical programming
90B80: Discrete location and assignment
Related Items
Online LIB problems: Heuristics for Bin Covering and lower bounds for Bin Packing, Semiconductor lot allocation using robust optimization, Lot-order assignment applying priority rules for the single-machine total tardiness scheduling with nonnegative time-dependent processing times, Evaluation of heuristics for a class-constrained lot-to-order matching problem in semiconductor manufacturing