IDEAS home Printed from https://ideas.repec.org/a/spr/operea/v18y2018i2d10.1007_s12351-016-0265-6.html
   My bibliography  Save this article

Some two-agent single-machine scheduling problems to minimize minmax and minsum of completion times

Author

Listed:
  • Xiaoling Cao

    (Yangtze University)

  • Wen-Hsing Wu

    (Yuanpei University)

  • Wen-Hung Wu

    (Kang-Ning University)

  • Chin-Chia Wu

    (Feng Chia University)

Abstract

In this study we address several two-agent problems in which the measure criterion is to minimize the maximum cost or total weighted completion of all the jobs, while subject to an upper bound on the maximum cost of agent A. In term of minimizing the maximum cost of all the jobs subject to an upper bound on the maximum cost of agent A, we discuss some optimal properties and propose polynomial time solution algorithm to solve it. In term of minimizing the total weighted completion of all the jobs subject to an upper bound on the maximum cost of agent A, we analyze the complexity, show that this problem is NP-hard, and discuss it under special cases. In addition, for minimizing the total weighted completion of all the jobs subject to an upper bound on the makespan of agent A, we derive some dominance rules to be used in a branch-and-bound method and propose a heuristic for finding the optimal and near-optimal solution, respectively. A computational simulation is also provided to determine the performance of the proposed algorithms.

Suggested Citation

  • Xiaoling Cao & Wen-Hsing Wu & Wen-Hung Wu & Chin-Chia Wu, 2018. "Some two-agent single-machine scheduling problems to minimize minmax and minsum of completion times," Operational Research, Springer, vol. 18(2), pages 293-314, July.
    • Handle: RePEc:spr:operea:v:18:y:2018:i:2:d:10.1007_s12351-016-0265-6
    DOI: 10.1007/s12351-016-0265-6
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s12351-016-0265-6
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s12351-016-0265-6?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.

    References listed on IDEAS

    as
    1. Wenchang Luo & Lin Chen & Guochuan Zhang, 2012. "Approximation schemes for two-machine flow shop scheduling with two agents," Journal of Combinatorial Optimization, Springer, vol. 24(3), pages 229-239, October.
    2. Mor, Baruch & Mosheiov, Gur, 2010. "Scheduling problems with two competing agents to minimize minmax and minsum earliness measures," European Journal of Operational Research, Elsevier, vol. 206(3), pages 540-546, November.
    3. Allesandro Agnetis & Pitu B. Mirchandani & Dario Pacciarelli & Andrea Pacifici, 2004. "Scheduling Problems with Two Competing Agents," Operations Research, INFORMS, vol. 52(2), pages 229-242, April.
    4. Joseph Y‐T. Leung & Haibing Li & Michael Pinedo, 2006. "Approximation algorithms for minimizing total weighted completion time of orders on identical machines in parallel," Naval Research Logistics (NRL), John Wiley & Sons, vol. 53(4), pages 243-260, June.
    5. Wan, Guohua & Vakati, Sudheer R. & Leung, Joseph Y.-T. & Pinedo, Michael, 2010. "Scheduling two agents with controllable processing times," European Journal of Operational Research, Elsevier, vol. 205(3), pages 528-539, September.
    6. Wan, Long & Yuan, Jinjiang & Wei, Lijun, 2016. "Pareto optimization scheduling with two competing agents to minimize the number of tardy jobs and the maximum cost," Applied Mathematics and Computation, Elsevier, vol. 273(C), pages 912-923.
    7. Fan, B.Q. & Cheng, T.C.E., 2016. "Two-agent scheduling in a flowshop," European Journal of Operational Research, Elsevier, vol. 252(2), pages 376-384.
    8. Cheng, Shuenn-Ren, 2014. "Some new problems on two-agent scheduling to minimize the earliness costs," International Journal of Production Economics, Elsevier, vol. 156(C), pages 24-30.
    9. Lee, Ik Sun, 2013. "Minimizing total tardiness for the order scheduling problem," International Journal of Production Economics, Elsevier, vol. 144(1), pages 128-134.
    10. Alessandro Agnetis & Dario Pacciarelli & Andrea Pacifici, 2007. "Multi-agent single machine scheduling," Annals of Operations Research, Springer, vol. 150(1), pages 3-15, March.
    11. Cheng, T.C.E. & Ng, C.T. & Yuan, J.J., 2008. "Multi-agent scheduling on a single machine with max-form criteria," European Journal of Operational Research, Elsevier, vol. 188(2), pages 603-609, July.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Cheng, Shuenn-Ren, 2014. "Some new problems on two-agent scheduling to minimize the earliness costs," International Journal of Production Economics, Elsevier, vol. 156(C), pages 24-30.
    2. Perez-Gonzalez, Paz & Framinan, Jose M., 2014. "A common framework and taxonomy for multicriteria scheduling problems with interfering and competing jobs: Multi-agent scheduling problems," European Journal of Operational Research, Elsevier, vol. 235(1), pages 1-16.
    3. Wang, Du-Juan & Yin, Yunqiang & Xu, Jianyou & Wu, Wen-Hsiang & Cheng, Shuenn-Ren & Wu, Chin-Chia, 2015. "Some due date determination scheduling problems with two agents on a single machine," International Journal of Production Economics, Elsevier, vol. 168(C), pages 81-90.
    4. Byung-Gyoo Kim & Byung-Cheon Choi & Myoung-Ju Park, 2017. "Two-Machine and Two-Agent Flow Shop with Special Processing Times Structures," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 34(04), pages 1-17, August.
    5. Yunqiang Yin & T. C. E. Cheng & Du-Juan Wang & Chin-Chia Wu, 2017. "Two-agent flowshop scheduling to maximize the weighted number of just-in-time jobs," Journal of Scheduling, Springer, vol. 20(4), pages 313-335, August.
    6. Zhang, Xingong, 2021. "Two competitive agents to minimize the weighted total late work and the total completion time," Applied Mathematics and Computation, Elsevier, vol. 406(C).
    7. Zhang Xingong & Wang Yong, 2017. "Two-agent scheduling problems on a single-machine to minimize the total weighted late work," Journal of Combinatorial Optimization, Springer, vol. 33(3), pages 945-955, April.
    8. Shi-Sheng Li & Ren-Xia Chen & Qi Feng, 2016. "Scheduling two job families on a single machine with two competitive agents," Journal of Combinatorial Optimization, Springer, vol. 32(3), pages 784-799, October.
    9. Enrique Gerstl & Baruch Mor & Gur Mosheiov, 2017. "Scheduling with two competing agents to minimize total weighted earliness," Annals of Operations Research, Springer, vol. 253(1), pages 227-245, June.
    10. Fan, B.Q. & Cheng, T.C.E., 2016. "Two-agent scheduling in a flowshop," European Journal of Operational Research, Elsevier, vol. 252(2), pages 376-384.
    11. Byung-Cheon Choi & Myoung-Ju Park, 2016. "An Ordered Flow Shop with Two Agents," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 33(05), pages 1-24, October.
    12. Shesh Narayan Sahu & Yuvraj Gajpal & Swapan Debbarma, 2018. "Two-agent-based single-machine scheduling with switchover time to minimize total weighted completion time and makespan objectives," Annals of Operations Research, Springer, vol. 269(1), pages 623-640, October.
    13. Chen, Rubing & Geng, Zhichao & Lu, Lingfa & Yuan, Jinjiang & Zhang, Yuan, 2022. "Pareto-scheduling of two competing agents with their own equal processing times," European Journal of Operational Research, Elsevier, vol. 301(2), pages 414-431.
    14. Lang, Fabian & Fink, Andreas & Brandt, Tobias, 2016. "Design of automated negotiation mechanisms for decentralized heterogeneous machine scheduling," European Journal of Operational Research, Elsevier, vol. 248(1), pages 192-203.
    15. Du-Juan Wang & Yunqiang Yin & Shuenn-Ren Cheng & T.C.E. Cheng & Chin-Chia Wu, 2016. "Due date assignment and scheduling on a single machine with two competing agents," International Journal of Production Research, Taylor & Francis Journals, vol. 54(4), pages 1152-1169, February.
    16. Mor, Baruch & Mosheiov, Gur, 2011. "Single machine batch scheduling with two competing agents to minimize total flowtime," European Journal of Operational Research, Elsevier, vol. 215(3), pages 524-531, December.
    17. Cheng He & Joseph Y.-T. Leung, 2017. "Two-agent scheduling of time-dependent jobs," Journal of Combinatorial Optimization, Springer, vol. 34(2), pages 362-377, August.
    18. Baruch Mor & Gur Mosheiov, 2017. "A two-agent single machine scheduling problem with due-window assignment and a common flow-allowance," Journal of Combinatorial Optimization, Springer, vol. 33(4), pages 1454-1468, May.
    19. Shi-Sheng Li & Ren-Xia Chen, 2023. "Competitive two-agent scheduling with release dates and preemption on a single machine," Journal of Scheduling, Springer, vol. 26(3), pages 227-249, June.
    20. Enrique Gerstl & Gur Mosheiov, 2014. "Single machine just‐in‐time scheduling problems with two competing agents," Naval Research Logistics (NRL), John Wiley & Sons, vol. 61(1), pages 1-16, February.

    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:spr:operea:v:18:y:2018:i:2:d:10.1007_s12351-016-0265-6. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.