IDEAS home Printed from https://ideas.repec.org/h/spr/oprchp/978-3-030-18500-8_52.html
   My bibliography  Save this book chapter

Modeling the Egg Packing Station Planning Problem

In: Operations Research Proceedings 2018

Author

Listed:
  • Reginald Dewil

    (KU Leuven)

  • Johan Philips

    (KU Leuven)

  • Jan Jaap Kempenaar

    (MOBA B.V.)

  • Dirk Cattrysse

    (KU Leuven)

Abstract

This paper presents the planning problem encountered by egg packing station managers. In an egg packing station, pallets containing unsorted eggs arrive daily from chicken farms and need to be packed into order-specific boxes on packing lanes. The grader automatically identifies damaged eggs and grades the remaining eggs in several weight classes. The number of packing lanes is station specific but can reach up to 32. The orders are destined for retailers and they specify the number of required eggs and a set of allowed grades. The challenge is to assign these orders to the packing lanes such that the incoming supply (distribution of grades) is completely covered by active orders on the packing lanes. This paper positions the egg packing problem in the optimization literature and proposes a model that efficiently covers this planning problem. Furthermore, we point out several future research directions such as additional practical work floor constraints and algorithmic challenges.

Suggested Citation

  • Reginald Dewil & Johan Philips & Jan Jaap Kempenaar & Dirk Cattrysse, 2019. "Modeling the Egg Packing Station Planning Problem," Operations Research Proceedings, in: Bernard Fortz & Martine LabbĂ© (ed.), Operations Research Proceedings 2018, pages 421-426, Springer.
    • Handle: RePEc:spr:oprchp:978-3-030-18500-8_52
    DOI: 10.1007/978-3-030-18500-8_52
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a search for a similarly titled item that would be available.

    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:spr:oprchp:978-3-030-18500-8_52. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.