A lot-sizing problem in an automated foundry

DOI10.1016/S0377-2217(01)00196-5zbMath0995.90024OpenAlexW1974331731WikidataQ127813680 ScholiaQ127813680MaRDI QIDQ1598716

Marcos Nereu Arenales, Elisangela dos Santos-Meza, Maristela Oliveira dos Santos

Publication date: 28 May 2002

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0377-2217(01)00196-5

zbMATH Keywords

schedulinglot sizinglinear and integer programming

Mathematics Subject Classification ID

Integer programming (90C10) Linear programming (90C05) Deterministic scheduling theory in operations research (90B35)

Related Items (5)

Production scheduling in a market-driven foundry: a mathematical programming approach versus a project scheduling metaheuristic algorithm ⋮ Lot sizing and furnace scheduling in small foundries ⋮ A knapsack problem as a tool to solve the production planning problem in small foundries ⋮ Discrete lot sizing and scheduling using product decomposition into attributes ⋮ The production planning problem of orders in small foundries

Cites Work

• Multilevel capacitated lotsizing complexity and LP-based heuristics
• Lot sizing and scheduling -- survey and extensions
• A heuristic method for lot-sizing in multi-stage systems
• Computationally Efficient Optimal Solutions to the Lot-Sizing Problem in Multistage Assembly Systems
• Mathematical Programming Approaches to Capacity-Constrained MRP Systems: Review, Formulation and Problem Reduction
• Heuristics for Multilevel Lot-Sizing with a Bottleneck
• Optimal Lot-Sizing Algorithms for Complex Product Structures
• Unnamed Item

This page was built for publication: A lot-sizing problem in an automated foundry