IDEAS home Printed from https://ideas.repec.org/a/taf/uiiexx/v54y2022i9p845-857.html
   My bibliography  Save this article

Throughput control and revenue optimization of a poultry product batcher

Author

Listed:
  • Kay Peeters
  • Ivo J. B. F. Adan
  • Tugce Martagan

Abstract

This article studies the optimal control of batching equipment in the poultry processing industry. The problem is to determine a control policy that maximizes the long-term average revenue while achieving a target throughput. This problem is formulated as a Markov Decision Process (MDP). The developed MDP model captures the unique characteristics of poultry processing operations, such as, the trade-off between giveaway and throughput. Structural properties of the optimal policy are derived for small-sized problems where batching equipment utilizes a single bin. Since the MDP model is numerically intractable for industry-sized problems, we propose a heuristic index policy with a Dynamic Rejection Threshold (DRT). The DRT heuristic is constructed based on the salient characteristics of the problem setting and is easy to implement in practice. Numerical experiments demonstrate that DRT performs well. We present an industry case study where DRT is benchmarked against current practice, which shows that the expected revenue can be potentially increased by over 2% (yielding an additional revenue between 750,000 and 2,270,000 Euros per year) through the use of DRT.

Suggested Citation

  • Kay Peeters & Ivo J. B. F. Adan & Tugce Martagan, 2022. "Throughput control and revenue optimization of a poultry product batcher," IISE Transactions, Taylor & Francis Journals, vol. 54(9), pages 845-857, June.
  • Handle: RePEc:taf:uiiexx:v:54:y:2022:i:9:p:845-857
    DOI: 10.1080/24725854.2021.1966556
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/24725854.2021.1966556
    Download Restriction: Access to full text is restricted to subscribers.

    File URL: https://libkey.io/10.1080/24725854.2021.1966556?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.

    More about this item

    Statistics

    Access and download statistics

    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:taf:uiiexx:v:54:y:2022:i:9:p:845-857. 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.

    We have no bibliographic references for this item. You can help adding them by using 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: Chris Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/uiie .

    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.