IDEAS home Printed from https://ideas.repec.org/h/spr/oprchp/978-3-319-28697-6_55.html
   My bibliography  Save this book chapter

Scheduling Identical Parallel Machines with a Fixed Number of Delivery Dates

In: Operations Research Proceedings 2014

Author

Listed:
  • Arne Mensendiek

    (Bielefeld University)

  • Jatinder N. D. Gupta

    (University of Alabama in Huntsville)

Abstract

We consider the scheduling problem of a manufacturer that has to process a set of jobs on identical parallel machines where jobs can only be delivered at a given number of delivery dates and the total tardiness is to be minimized. In order to avoid tardiness, jobs have to be both, processed and delivered before or at their due dates. Such settings are frequently found in industry, for example when a manufacturer relies on a logistics provider that picks up completed jobs twice a day. The scheduling problem with fixed delivery dates where the delivery dates are considered as an exogenously given parameter for the manufacturer’ scheduling decisions can be solved by various optimal and heuristic solution procedures. Here, we consider a variant of this problem where only the number of deliveries is fixed and the delivery dates can be set arbitrarily. For example, a manufacturer may be entitled to assign the logistics provider two pick-up times per day and decide on the exact times of these pick-ups. Then, the machine schedule and the delivery dates can be determined simultaneously which may significantly improve adherence to due dates. Our findings can provide valuable input when it comes to evaluating and selecting distribution strategies that offer a different extent of flexibility regarding the delivery dates.

Suggested Citation

  • Arne Mensendiek & Jatinder N. D. Gupta, 2016. "Scheduling Identical Parallel Machines with a Fixed Number of Delivery Dates," Operations Research Proceedings, in: Marco Lübbecke & Arie Koster & Peter Letmathe & Reinhard Madlener & Britta Peis & Grit Walther (ed.), Operations Research Proceedings 2014, edition 1, pages 393-398, Springer.
    • Handle: RePEc:spr:oprchp:978-3-319-28697-6_55
    DOI: 10.1007/978-3-319-28697-6_55
    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-319-28697-6_55. 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.