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

Proportionate Flow Shop Scheduling with Two Competing Agents to Minimize Weighted Late Work and Weighted Number of Late Jobs

Author

Listed:
  • Ren-Xia Chen

    (Department of Applied Mathematics, Zhongyuan University of Technology, Zhengzhou 450007, P. R. China)

  • Shi-Sheng Li

    (Department of Information and Computation Science, Zhongyuan University of Technology, Zhengzhou 450007, P. R. China)

Abstract

We investigate a competitive two-agent scheduling problem in the setting of proportionate flow shop, where the job processing times are machine-independent. The scheduling criterion of one agent is to minimize its total weighted late work, and the scheduling criterion of the other agent is to minimize its total weighted number of late jobs. The goal is to find the Pareto-optimal curve (i.e., the set of all Pareto-optimal points) and identify a corresponding Pareto-optimal schedule for each Pareto-optimal point. An exact pseudo-polynomial-time algorithm and an 𝜖-approximate Pareto-optimal curve are designed to solve the problem, respectively.

Suggested Citation

  • Ren-Xia Chen & Shi-Sheng Li, 2021. "Proportionate Flow Shop Scheduling with Two Competing Agents to Minimize Weighted Late Work and Weighted Number of Late Jobs," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 38(02), pages 1-19, April.
    • Handle: RePEc:wsi:apjorx:v:38:y:2021:i:02:n:s0217595920500463
    DOI: 10.1142/S0217595920500463
    as

    Download full text from publisher

    File URL: http://www.worldscientific.com/doi/abs/10.1142/S0217595920500463
    Download Restriction: Access to full text is restricted to subscribers
    File URL: https://libkey.io/10.1142/S0217595920500463?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. Shi-Sheng Li & Ren-Xia Chen, 2022. "Minimizing total weighted late work on a single-machine with non-availability intervals," Journal of Combinatorial Optimization, Springer, vol. 44(2), pages 1330-1355, 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:38:y:2021:i:02:n:s0217595920500463. 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.