IDEAS home Printed from https://ideas.repec.org/h/spr/lnopch/978-3-031-24907-5_6.html
   My bibliography  Save this book chapter

Solving Customer Order Scheduling Problems with an Iterated Greedy Algorithm

In: Operations Research Proceedings 2022

Author

Listed:
  • Julius Hoffmann

    (Technische Universität Dresden)

Abstract

In this paper, three configurations of the customer order scheduling problem are presented. In contrast to classical scheduling problems, the customer order scheduling problem considers the scheduling of jobs that belong to customer orders and each order is only completed when each job of the order has finished. The studied configurations are the minimization of the sum of order completion times and the minimization of the earliness-tardiness in a machine environment where each order places one job on each machine. Furthermore, the minimization of the sum of order completion times in a flow shop environment is investigated. This paper states properties of the three problem configurations and describes developed solution methods that performed well in a computational experiment.

Suggested Citation

  • Julius Hoffmann, 2023. "Solving Customer Order Scheduling Problems with an Iterated Greedy Algorithm," Lecture Notes in Operations Research, in: Oliver Grothe & Stefan Nickel & Steffen Rebennack & Oliver Stein (ed.), Operations Research Proceedings 2022, chapter 0, pages 43-49, Springer.
    • Handle: RePEc:spr:lnopch:978-3-031-24907-5_6
    DOI: 10.1007/978-3-031-24907-5_6
    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:lnopch:978-3-031-24907-5_6. 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.