IDEAS home Printed from https://ideas.repec.org/a/wsi/apjorx/v40y2023i04ns0217595923400079.html
   My bibliography  Save this article

A Single Machine Group Scheduling Problem with Due Date Assignment and Position-Dependent Costs

Author

Listed:
  • Ying Chen

    (School of Management, Xi’an Jiaotong University, Xi’an 710049, P. R. China)

  • Yi Xu

    (School of Economics and Management, Xi’an University of Technology, Xi’an 710054, P. R. China)

  • Guiqing Zhang

    (School of Economics and Finance, Xi’an Jiaotong University, Xi’an 710049, P. R. China)

  • Yongxi Cheng

    (School of Management, Xi’an Jiaotong University, Xi’an 710049, P. R. China4State Key Lab for Manufacturing Systems Engineering, Xi’an 710049, P. R. China)

Abstract

In this paper, we study a single machine scheduling problem with due date assignment under a group technology environment. The due dates of jobs are assignable according to the following three methods: the common (CON) due date assignment, the slack (SLK) due date assignment, and the different (DIF) due date assignment. Our objective is to determine a group sequence and job sequences within all groups, together with a due date assignment, to minimize a total cost function including earliness, tardiness, due date assignment and flow time costs, in which all unit costs are different and position-dependent. We present a unified O(nlog n) time algorithm to solve the problem for all the three due date assignment methods.

Suggested Citation

  • Ying Chen & Yi Xu & Guiqing Zhang & Yongxi Cheng, 2023. "A Single Machine Group Scheduling Problem with Due Date Assignment and Position-Dependent Costs," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 40(04), pages 1-20, August.
    • Handle: RePEc:wsi:apjorx:v:40:y:2023:i:04:n:s0217595923400079
    DOI: 10.1142/S0217595923400079
    as

    Download full text from publisher

    File URL: http://www.worldscientific.com/doi/abs/10.1142/S0217595923400079
    Download Restriction: Access to full text is restricted to subscribers
    File URL: https://libkey.io/10.1142/S0217595923400079?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. Oğuzhan Ahmet Arık, 2024. "Optimal policies for minimizing total job completion times and deviations from common due dates in unrelated parallel machine scheduling," OPSEARCH, Springer;Operational Research Society of India, vol. 61(3), pages 1654-1680, September.

    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:wsi:apjorx:v:40:y:2023:i:04:n:s0217595923400079. 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: Tai Tone Lim (email available below). General contact details of provider: http://www.worldscinet.com/apjor/apjor.shtml .

    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.