IDEAS home Printed from https://ideas.repec.org/h/spr/oprchp/978-3-540-27679-1_27.html
   My bibliography  Save this book chapter

A Single Processor Scheduling Problem with a Common Due Window Assignment

In: Operations Research Proceedings 2004

Author

Listed:
  • Adam Janiak

    (Wroclaw University of Technology)

  • Marcin Winczaszek

    (Wroclaw University of Technology)

Abstract

We consider a single processor scheduling problem with a common due window assignment. Jobs completed within the due window incur no penalty, while other jobs incur either earliness or tardiness penalties. Boundaries of the due window are decision variables. The objective is to minimize the sum of the total weighted earliness, the total weighted tardiness and due window width penalty. This problem is an extension of the classical Weighted Earliness and Tardiness problem (WET). We proved that our problem is NP-hard and presented some properties of an optimal solution. To solve the problem we constructed a dynamic programming algorithm and a fully polynomial time approximation scheme. We also presented a polynomial time algorithm for the case with unit job processing times.

Suggested Citation

  • Adam Janiak & Marcin Winczaszek, 2005. "A Single Processor Scheduling Problem with a Common Due Window Assignment," Operations Research Proceedings, in: Hein Fleuren & Dick Hertog & Peter Kort (ed.), Operations Research Proceedings 2004, pages 213-220, Springer.
    • Handle: RePEc:spr:oprchp:978-3-540-27679-1_27
    DOI: 10.1007/3-540-27679-3_27
    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.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Janiak, Adam & Janiak, Władysław A. & Krysiak, Tomasz & Kwiatkowski, Tomasz, 2015. "A survey on scheduling problems with due windows," European Journal of Operational Research, Elsevier, vol. 242(2), pages 347-357.

    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:spr:oprchp:978-3-540-27679-1_27. 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.