Repository logo

Infoscience

  • English
  • French
Log In
Logo EPFL, École polytechnique fédérale de Lausanne

Infoscience

  • English
  • French
Log In
  1. Home
  2. Academic and Research Output
  3. Journal articles
  4. Minimum-Cost Ordering for Selective Assembly
 
research article

Minimum-Cost Ordering for Selective Assembly

Weber, T. A.  
April 1, 2025
IISE Transactions

We consider the minimization of input cost for a selective assembly system that features two random inputs and a finite number of matching classes. This setup frequently arises in high-precision manufacturing when input tolerances are not tight enough for the required output precision. We determine optimality conditions for the cost-optimal input portfolio given an expected-output target, first using a normal approximation of the multinomial binning distribution, and second employing a simple upper envelope of the output objective. We show that the relative error tends to zero as the production scale becomes sufficiently large. The envelope optimization problem also yields a closed-form solution for the cost-minimizing inputs as well as total costs, which are easy to understand for managers. A numerical study tests the practicality of the envelope approach. The latter can be used as seed for a numerical solution of the exact problem, as well as a closed-form approximation, which allows for an analysis of structural properties.

  • Files
  • Details
  • Metrics
Loading...
Thumbnail Image
Name

Weber-IISE-Transactions-2025.pdf

Type

Main Document

Version

Published version

Access type

openaccess

License Condition

CC BY

Size

1.29 MB

Format

Adobe PDF

Checksum (MD5)

e228d30003d87ce57f27bf626bdf8c1b

Logo EPFL, École polytechnique fédérale de Lausanne
  • Contact
  • infoscience@epfl.ch

  • Follow us on Facebook
  • Follow us on Instagram
  • Follow us on LinkedIn
  • Follow us on X
  • Follow us on Youtube
AccessibilityLegal noticePrivacy policyCookie settingsEnd User AgreementGet helpFeedback

Infoscience is a service managed and provided by the Library and IT Services of EPFL. © EPFL, tous droits réservés