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

Due-Window Assignment Methods and Scheduling with Generalized Positional-Dependent Weights

Author

Listed:
  • Ji-Bo Wang

    (School of Science, Shenyang Aerospace University, Shenyang 110136, P. R. China)

  • Si-Han Wang

    (School of Science, Shenyang Aerospace University, Shenyang 110136, P. R. China)

  • Kaipeng Cao

    (College of Economic and Management, Yunnan Agricultural University, Kunming 650201, Yunnan, P. R. China)

  • Mengqi Liu

    (Business School, Hunan University, Changsha 410082, Hunan, P. R. China)

  • Xue Jia

    (School of Science, Shenyang Aerospace University, Shenyang 110136, P. R. China)

Abstract

We focus on a single-machine scheduling problem with common and slack due-window assignment methods. Both the job sequence and due-windows are decision variables to be determined by the decision maker. We consider the following performance criterion: the total weighted number of early and late jobs plus the total weighted of earliness, tardiness and due-window assignment cost, where the weights depend on the position in which a job is scheduled. Some properties are established, and it is shown that the problem can be solved in O(n5) time, where n is the number of jobs. The extensions of the model are to cases of general position-dependent processing times and time-dependent processing times.

Suggested Citation

  • Ji-Bo Wang & Si-Han Wang & Kaipeng Cao & Mengqi Liu & Xue Jia, 2022. "Due-Window Assignment Methods and Scheduling with Generalized Positional-Dependent Weights," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 39(05), pages 1-19, October.
  • Handle: RePEc:wsi:apjorx:v:39:y:2022:i:05:n:s0217595922500282
    DOI: 10.1142/S0217595922500282
    as

    Download full text from publisher

    File URL: http://www.worldscientific.com/doi/abs/10.1142/S0217595922500282
    Download Restriction: Access to full text is restricted to subscribers

    File URL: https://libkey.io/10.1142/S0217595922500282?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. Yi-Chun Wang & Si-Han Wang & Ji-Bo Wang, 2023. "Resource Allocation Scheduling with Position-Dependent Weights and Generalized Earliness–Tardiness Cost," Mathematics, MDPI, vol. 11(1), pages 1-11, January.

    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:39:y:2022:i:05:n:s0217595922500282. 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.