Bin covering algorithms in the second stage of the lot to order matching problem

DOI10.1057/palgrave.jors.2601222zbMath1181.90164OpenAlexW1970994421MaRDI 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

zbMATH Keywords

linear programmingheuristicsbin coveringsemiconductor manufacturing

Mathematics Subject Classification ID

Linear programming (90C05) Approximation methods and heuristics in mathematical programming (90C59) Discrete location and assignment (90B80)

Related Items (4)

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 ⋮ Semiconductor lot allocation using robust optimization ⋮ Online LIB problems: Heuristics for Bin Covering and lower bounds for Bin Packing

This page was built for publication: Bin covering algorithms in the second stage of the lot to order matching problem