IDEAS home Printed from https://ideas.repec.org/a/taf/tjorxx/v73y2021i11p2551-2571.html
   My bibliography  Save this article

Scheduling controllable processing time jobs in seru production system with resource allocation

Author

Listed:
  • Yujing Jiang
  • Zhe Zhang
  • Xiaoling Song
  • Yong Yin

Abstract

In this article, four scheduling problems with controllable processing times and resource allocation in seru production system (SPS) are first studied. The objective is to minimize the total processing cost plus scheduling measures, which are the total waiting time, the total absolute differences in completion times, the total absolute differences in waiting times and the total earliness and tardiness, respectively. A general exact solution method is proposed to show that these four problems can be transformed into assignment problems and solved in polynomial time if the number of serus and processing times are given in advance. Computational experiments are made finally, and results indicate that the exact solution method is effective to return optimal schedules for four seru scheduling problems. Further, the schedule flexibility of SPS can be enhanced by considering controllable processing times, and workload balance is also need to be concern in seru production practice.

Suggested Citation

  • Yujing Jiang & Zhe Zhang & Xiaoling Song & Yong Yin, 2021. "Scheduling controllable processing time jobs in seru production system with resource allocation," Journal of the Operational Research Society, Taylor & Francis Journals, vol. 73(11), pages 2551-2571, December.
    • Handle: RePEc:taf:tjorxx:v:73:y:2021:i:11:p:2551-2571
    DOI: 10.1080/01605682.2021.1999182
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/01605682.2021.1999182
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1080/01605682.2021.1999182?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Citations

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


    Cited by:

    1. Li, Dongni & Jiang, Yuzhou & Zhang, Jinhui & Cui, Zihua & Yin, Yong, 2023. "An on-line seru scheduling algorithm with proactive waiting considering resource conflicts," European Journal of Operational Research, Elsevier, vol. 309(2), pages 506-515.

    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:taf:tjorxx:v:73:y:2021:i:11:p:2551-2571. 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: Chris Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/tjor .

    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.