IDEAS home Printed from https://ideas.repec.org/h/spr/spochp/978-1-4614-1123-9_1.html
   My bibliography  Save this book chapter

Scheduling to Maximize the Number of Just-in-Time Jobs: A Survey

In: Just-in-Time Systems

Author

Listed:
  • Dvir Shabtay

    (Ben-Gurion University of the Negev)

  • George Steiner

    (McMaster University)

Abstract

In just-in-time (JIT) scheduling, the usual objective is to minimize a cost function which includes a penalty for both the early and tardy completion of jobs. In this paper, we survey results for a cost function that is related to the number of early and tardy jobs rather than the actual earliness and tardiness values. More specifically, we study the problem of maximizing the weighted number of jobs which are completed exactly on their due date (i.e., in JIT mode). Our survey covers the literature for various scheduling environments both with fixed and controllable processing times. We also describe several new algorithms for certain flow-shop problems.

Suggested Citation

  • Dvir Shabtay & George Steiner, 2012. "Scheduling to Maximize the Number of Just-in-Time Jobs: A Survey," Springer Optimization and Its Applications, in: Roger Z. Ríos-Mercado & Yasmín A. Ríos-Solís (ed.), Just-in-Time Systems, chapter 0, pages 3-20, Springer.
    • Handle: RePEc:spr:spochp:978-1-4614-1123-9_1
    DOI: 10.1007/978-1-4614-1123-9_1
    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. Baruch Mor & Gur Mosheiov, 2022. "Single machine scheduling to maximize the weighted number of on-time jobs with job-rejection," Operational Research, Springer, vol. 22(3), pages 2707-2719, July.
    2. Danny Hermelin & Dvir Shabtay & Nimrod Talmon, 2019. "On the parameterized tractability of the just-in-time flow-shop scheduling problem," Journal of Scheduling, Springer, vol. 22(6), pages 663-676, December.
    3. Matan Atsmony & Gur Mosheiov, 2023. "Scheduling to maximize the weighted number of on-time jobs on parallel machines with bounded job-rejection," Journal of Scheduling, Springer, vol. 26(2), pages 193-207, April.

    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:spochp:978-1-4614-1123-9_1. 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.