An heuristic algorithm for a multi-product, single machine capacitated production scheduling problem

DOI10.1016/S0305-0548(99)00035-0zbMath0999.90015OpenAlexW1974076864MaRDI QIDQ1818572

R. Michael Harnett, James Boyd Bankston

Publication date: 30 November 2002

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0305-0548(99)00035-0

zbMATH Keywords

heuristicimplicit enumerationnonlinear integer optimizationcapacitated production scheduling

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Production models (90B30) Case-oriented studies in operations research (90B90)

Related Items (1)

Capacitated lot sizing and scheduling with parallel machines and shared buffers: A case study in a packaging company

This page was built for publication: An heuristic algorithm for a multi-product, single machine capacitated production scheduling problem