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

Single-Machine Scheduling Problems Simultaneous with Deteriorating and Learning Effects Under a Deteriorating Maintenance Consideration

In: Just-in-Time Systems

Author

Listed:
  • Suh-Jenq Yang

    (Nan Kai University of Technology)

  • Dar-Li Yang

    (National Formosa University)

Abstract

Machine scheduling problems in just-in-time production environments are important issues in modern operations management to satisfy customer demand for superior service. In this paper, we investigate single-machine scheduling problems with simultaneous considerations of the effects of deterioration and learning. Due to the deteriorating effect, maintenance may be performed on the machine to improve its production efficiency. We assume that at most one maintenance is allowed throughout the scheduling horizon. We further assume that the maintenance duration depends on its starting time. Our goal is to find jointly the optimal time to perform the maintenance, the optimal location of the due-window, and the optimal job sequence such that the total cost that includes earliness, tardiness, and due-window size and location penalties is minimized. We also aim to investigate the makespan, the total completion time, and the total absolute deviation of completion times minimization problems. We propose polynomial time algorithms for all the studied problems.

Suggested Citation

  • Suh-Jenq Yang & Dar-Li Yang, 2012. "Single-Machine Scheduling Problems Simultaneous with Deteriorating and Learning Effects Under a Deteriorating Maintenance Consideration," 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 41-65, Springer.
    • Handle: RePEc:spr:spochp:978-1-4614-1123-9_3
    DOI: 10.1007/978-1-4614-1123-9_3
    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. Derya Deliktaş, 2022. "Self-adaptive memetic algorithms for multi-objective single machine learning-effect scheduling problems with release times," Flexible Services and Manufacturing Journal, Springer, vol. 34(3), pages 748-784, September.
    2. Xu, Dehua & Wan, Long & Liu, Aihua & Yang, Dar-Li, 2015. "Single machine total completion time scheduling problem with workload-dependent maintenance duration," Omega, Elsevier, vol. 52(C), pages 101-106.

    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_3. 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.