An efficient algorithm for maximizing the expected profit from a serial production line with inspection stations and rework

DOI10.1007/s00291-012-0304-5zbMath1282.90064OpenAlexW2007080167MaRDI QIDQ2393122

Tal Raviv

Publication date: 7 August 2013

Published in: OR Spectrum (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00291-012-0304-5

zbMATH Keywords

productionquality managementinspection allocationserial production lines

Mathematics Subject Classification ID

Reliability, availability, maintenance, inspection in operations research (90B25) Production models (90B30)

Related Items (1)

Inspection location in capacity-constrained lines

Cites Work

• Unnamed Item
• A polynomial time algorithm for solving a quality control Station configuration problem
• Optimal inspection policies in a serial production system including scrap rework and repair: An MILP approach
• Inspection resource assignment in a multistage manufacturing system with an inspection error model
• Optimizing the quality control station configuration
• Shortest Route Models for the Allocation of Inspection Effort on a Production Line

This page was built for publication: An efficient algorithm for maximizing the expected profit from a serial production line with inspection stations and rework