IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v282y2020i1p267-276.html
   My bibliography  Save this article

On the importance of variability when managing metrology capacity

Author

Listed:
  • Dauzère-Pérès, Stéphane
  • Hassoun, Michael

Abstract

In-line quality control is a crucial and increasingly constraining activity, in particular in high technology manufacturing. In this paper, we study a single metrology tool assigned to control the production quality of multiple heterogeneous machines. We introduce, model and study the tradeoff between the quality loss resulting from the sampling policy, and the quality loss induced by delays in the metrology queue. An iterative approach is proposed to optimize sampling periods using the solution of a relaxed problem which assumes full synchronization between production and metrology, and which has been previously formalized and solved. Based on computational and simulation results, and a prediction model, the paper ends with recommendations to better manage metrology capacity utilization under various levels of variability.

Suggested Citation

  • Dauzère-Pérès, Stéphane & Hassoun, Michael, 2020. "On the importance of variability when managing metrology capacity," European Journal of Operational Research, Elsevier, vol. 282(1), pages 267-276.
    • Handle: RePEc:eee:ejores:v:282:y:2020:i:1:p:267-276
    DOI: 10.1016/j.ejor.2019.09.014
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377221719307544
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.ejor.2019.09.014?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Goyal, S. K. & Gunasekaran, A. & Martikainen, T. & Yli-Olli, P., 1993. "Integrating production and quality control policies: A survey," European Journal of Operational Research, Elsevier, vol. 69(1), pages 1-13, August.
    2. Prabhakant Sinha & Andris A. Zoltners, 1979. "The Multiple-Choice Knapsack Problem," Operations Research, INFORMS, vol. 27(3), pages 503-515, June.
    3. He, Xin-Feng & Wu, Su & Li, Quan-Lin, 2007. "Production variability of production lines," International Journal of Production Economics, Elsevier, vol. 107(1), pages 78-87, May.
    4. Nduhura Munga, Justin & Dauzère-Pérès, Stéphane & Yugma, Claude & Vialletelle, Philippe, 2015. "A mathematical programming approach for optimizing control plans in semiconductor manufacturing," International Journal of Production Economics, Elsevier, vol. 160(C), pages 213-219.
    5. Jingshan Li & Semyon Meerkov, 2000. "Production variability in manufacturing systems: Bernoulli reliability case," Annals of Operations Research, Springer, vol. 93(1), pages 299-324, January.
    6. Tan, Bar[iota]s, 1999. "Variance of the output as a function of time: Production line dynamics," European Journal of Operational Research, Elsevier, vol. 117(3), pages 470-484, September.
    7. Kalir, Adar A. & Sarin, Subhash C., 2009. "A method for reducing inter-departure time variability in serial production lines," International Journal of Production Economics, Elsevier, vol. 120(2), pages 340-347, August.
    8. Stéphane Dauzère-Pérès & Michael Hassoun & Alejandro Sendon, 2016. "Allocating metrology capacity to multiple heterogeneous machines," International Journal of Production Research, Taylor & Francis Journals, vol. 54(20), pages 6082-6091, October.
    9. Tang, Christopher S., 1991. "Designing an optimal production system with inspection," European Journal of Operational Research, Elsevier, vol. 52(1), pages 45-54, May.
    10. Zapfel, G. & Missbauer, H., 1993. "Production Planning and Control (PPC) systems including load-oriented order release -- Problems and research perspectives," International Journal of Production Economics, Elsevier, vol. 30(1), pages 107-122, July.
    11. Pisinger, David, 1995. "A minimal algorithm for the multiple-choice knapsack problem," European Journal of Operational Research, Elsevier, vol. 83(2), pages 394-410, June.
    12. Bouslah, B. & Gharbi, A. & Pellerin, R., 2016. "Integrated production, sampling quality control and maintenance of deteriorating production systems with AOQL constraint," Omega, Elsevier, vol. 61(C), pages 110-126.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Zhong, Tao & Young, Rhonda, 2010. "Multiple Choice Knapsack Problem: Example of planning choice in transportation," Evaluation and Program Planning, Elsevier, vol. 33(2), pages 128-137, May.
    2. Degraeve, Z. & Jans, R.F., 2003. "Improved Lower Bounds For The Capacitated Lot Sizing Problem With Set Up Times," ERIM Report Series Research in Management ERS-2003-026-LIS, Erasmus Research Institute of Management (ERIM), ERIM is the joint research institute of the Rotterdam School of Management, Erasmus University and the Erasmus School of Economics (ESE) at Erasmus University Rotterdam.
    3. K. M. Kamna & Prerna Gautam & Chandra K. Jaggi, 0. "Sustainable inventory policy for an imperfect production system with energy usage and volume agility," International Journal of System Assurance Engineering and Management, Springer;The Society for Reliability, Engineering Quality and Operations Management (SREQOM),India, and Division of Operation and Maintenance, Lulea University of Technology, Sweden, vol. 0, pages 1-9.
    4. Tue R. L. Christensen & Kim Allan Andersen & Andreas Klose, 2013. "Solving the Single-Sink, Fixed-Charge, Multiple-Choice Transportation Problem by Dynamic Programming," Transportation Science, INFORMS, vol. 47(3), pages 428-438, August.
    5. Edward Y H Lin & Chung-Min Wu, 2004. "The multiple-choice multi-period knapsack problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 55(2), pages 187-197, February.
    6. Drexl, Andreas & Jørnsten, Kurt, 2007. "Pricing the multiple-choice nested knapsack problem," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 626, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
    7. K. M. Kamna & Prerna Gautam & Chandra K. Jaggi, 2021. "Sustainable inventory policy for an imperfect production system with energy usage and volume agility," International Journal of System Assurance Engineering and Management, Springer;The Society for Reliability, Engineering Quality and Operations Management (SREQOM),India, and Division of Operation and Maintenance, Lulea University of Technology, Sweden, vol. 12(1), pages 44-52, February.
    8. Coniglio, Stefano & Furini, Fabio & San Segundo, Pablo, 2021. "A new combinatorial branch-and-bound algorithm for the Knapsack Problem with Conflicts," European Journal of Operational Research, Elsevier, vol. 289(2), pages 435-455.
    9. Endre Boros & Noam Goldberg & Paul Kantor & Jonathan Word, 2011. "Optimal sequential inspection policies," Annals of Operations Research, Springer, vol. 187(1), pages 89-119, July.
    10. Ewa M. Bednarczuk & Janusz Miroforidis & Przemysław Pyzel, 2018. "A multi-criteria approach to approximate solution of multiple-choice knapsack problem," Computational Optimization and Applications, Springer, vol. 70(3), pages 889-910, July.
    11. Pisinger, David, 2001. "Budgeting with bounded multiple-choice constraints," European Journal of Operational Research, Elsevier, vol. 129(3), pages 471-480, March.
    12. Abdelkader Sbihi, 2007. "A best first search exact algorithm for the Multiple-choice Multidimensional Knapsack Problem," Journal of Combinatorial Optimization, Springer, vol. 13(4), pages 337-351, May.
    13. Christensen, Tue R.L. & Labbé, Martine, 2015. "A branch-cut-and-price algorithm for the piecewise linear transportation problem," European Journal of Operational Research, Elsevier, vol. 245(3), pages 645-655.
    14. Guo R. & Ascher H. & Love E., 2001. "Towards Practical and Synthetical Modelling of Repairable Systems," Stochastics and Quality Control, De Gruyter, vol. 16(1), pages 147-182, January.
    15. Shuaian Wang & Dan Zhuge & Lu Zhen & Chung-Yee Lee, 2021. "Liner Shipping Service Planning Under Sulfur Emission Regulations," Transportation Science, INFORMS, vol. 55(2), pages 491-509, March.
    16. Walter, Rico & Schulze, Philipp & Scholl, Armin, 2021. "SALSA: Combining branch-and-bound with dynamic programming to smoothen workloads in simple assembly line balancing," European Journal of Operational Research, Elsevier, vol. 295(3), pages 857-873.
    17. Drexl, Andreas & Haase, Knut, 1996. "Fast approximation methods for sales force deployment," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 411, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
    18. Mohammadivojdan, Roshanak & Geunes, Joseph, 2018. "The newsvendor problem with capacitated suppliers and quantity discounts," European Journal of Operational Research, Elsevier, vol. 271(1), pages 109-119.
    19. Mhand Hifi & Slim Sadfi & Abdelkader Sbihi, 2004. "An Exact Algorithm for the Multiple-choice Multidimensional Knapsack Problem," Post-Print halshs-03322716, HAL.
    20. George Kozanidis, 2009. "Solving the linear multiple choice knapsack problem with two objectives: profit and equity," Computational Optimization and Applications, Springer, vol. 43(2), pages 261-294, June.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:ejores:v:282:y:2020:i:1:p:267-276. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.