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

A Bicriterion Approach to Due Date Assignment Scheduling in Single-Machine with Position-Dependent Weights

Author

Listed:
  • Xinyu Sun

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

  • Xin-Na Geng

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

  • Jiayin Wang

    (School of Computer Science and Technology, Xi’an Jiaotong University, Xi’an 710049, P. R. China)

  • Tao Liu

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

Abstract

We study single-machine bicriteria scheduling problems with position-dependent weights. Due date costs and penalty costs can affect the decision-maker’s profit. Therefore, how to optimize the benefits and balance of these costs for decision-makers is the focus of this research. This paper discusses three models: weighted-sum scheduling problem, constrained scheduling problem, Pareto scheduling problem. It analyzes the properties of bicriteria schedule, determines the optimal due dates (usually referred to as different due dates: DIF), and gives the corresponding polynomial solvable algorithms.

Suggested Citation

  • Xinyu Sun & Xin-Na Geng & Jiayin Wang & Tao Liu, 2023. "A Bicriterion Approach to Due Date Assignment Scheduling in Single-Machine with Position-Dependent Weights," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 40(02), pages 1-17, April.
    • Handle: RePEc:wsi:apjorx:v:40:y:2023:i:02:n:s021759592250018x
    DOI: 10.1142/S021759592250018X
    as

    Download full text from publisher

    File URL: http://www.worldscientific.com/doi/abs/10.1142/S021759592250018X
    Download Restriction: Access to full text is restricted to subscribers
    File URL: https://libkey.io/10.1142/S021759592250018X?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.

    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:02:n:s021759592250018x. 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.