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

Proportionate Flow Shop Scheduling with Job-dependent Due Windows and Position-dependent Weights

Author

Listed:
  • Ji-Bo Wang

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

  • Dan-Yang Lv

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

  • Congying Wan

    (Institute of Economic and Social Development, Dongbei University of Finance and Economics Dalian, Liaoning 116025, P. R. China)

Abstract

In this paper, we deal with the different due windows assignment proportionate flow shop problem with position-dependent weights, where the sequence is a permutation. The objective is to determine an optimal job sequence and due windows of all jobs such that the weighted sum of earliness–tardiness, the starting time and size of all due windows is to be minimized, where the weight is not related to the job but to the position in which some job is scheduled, i.e., position-dependent weights. According to a series of optimal properties, we prove that the problem can be solved in polynomial time O(n2), where n is the number of jobs.

Suggested Citation

  • Ji-Bo Wang & Dan-Yang Lv & Congying Wan, 2025. "Proportionate Flow Shop Scheduling with Job-dependent Due Windows and Position-dependent Weights," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 42(02), pages 1-17, April.
    • Handle: RePEc:wsi:apjorx:v:42:y:2025:i:02:n:s0217595924500118
    DOI: 10.1142/S0217595924500118
    as

    Download full text from publisher

    File URL: http://www.worldscientific.com/doi/abs/10.1142/S0217595924500118
    Download Restriction: Access to full text is restricted to subscribers
    File URL: https://libkey.io/10.1142/S0217595924500118?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:42:y:2025:i:02:n:s0217595924500118. 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.