IDEAS home Printed from https://ideas.repec.org/a/spr/jcomop/v12y2006i4d10.1007_s10878-006-9001-0.html
   My bibliography  Save this article

A note on the complexity of the problem of two-agent scheduling on a single machine

Author

Listed:
  • C. T. Ng

    (The Hong Kong Polytechnic University, Hung Hom)

  • T. C. E. Cheng

    (The Hong Kong Polytechnic University, Hung Hom)

  • J. J. Yuan

    (Zhengzhou University)

Abstract

We consider a two-agent scheduling problem on a single machine, where the objective is to minimize the total completion time of the first agent with the restriction that the number of tardy jobs of the second agent cannot exceed a given number. It is reported in the literature that the complexity of this problem is still open. We show in this paper that this problem is NP-hard under high multiplicity encoding and can be solved in pseudo-polynomial time under binary encoding. When the first agent's objective is to minimize the total weighted completion time, we show that the problem is strongly NP-hard even when the number of tardy jobs of the second agent is restricted to be zero.

Suggested Citation

  • C. T. Ng & T. C. E. Cheng & J. J. Yuan, 2006. "A note on the complexity of the problem of two-agent scheduling on a single machine," Journal of Combinatorial Optimization, Springer, vol. 12(4), pages 387-394, December.
    • Handle: RePEc:spr:jcomop:v:12:y:2006:i:4:d:10.1007_s10878-006-9001-0
    DOI: 10.1007/s10878-006-9001-0
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10878-006-9001-0
    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/s10878-006-9001-0?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. Dorit S. Hochbaum & Ron Shamir, 1991. "Strongly Polynomial Algorithms for the High Multiplicity Scheduling Problem," Operations Research, INFORMS, vol. 39(4), pages 648-653, August.
    2. 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.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    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. Yaodong Ni & Zhaojun Zhao, 2017. "Two-agent scheduling problem under fuzzy environment," Journal of Intelligent Manufacturing, Springer, vol. 28(3), pages 739-748, March.
    3. 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.
    4. Shisheng Li & T.C.E. Cheng & C.T. Ng & Jinjiang Yuan, 2017. "Two‐agent scheduling on a single sequential and compatible batching machine," Naval Research Logistics (NRL), John Wiley & Sons, vol. 64(8), pages 628-641, December.
    5. Kejun Zhao & Xiwen Lu, 2016. "Two approximation algorithms for two-agent scheduling on parallel machines to minimize makespan," Journal of Combinatorial Optimization, Springer, vol. 31(1), pages 260-278, January.
    6. 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.
    7. Donatas Elvikis & Vincent T’kindt, 2014. "Two-agent scheduling on uniform parallel machines with min-max criteria," Annals of Operations Research, Springer, vol. 213(1), pages 79-94, February.
    8. Yuan Zhang & Jinjiang Yuan, 2019. "A note on a two-agent scheduling problem related to the total weighted late work," Journal of Combinatorial Optimization, Springer, vol. 37(3), pages 989-999, April.
    9. Ruyan He & Jinjiang Yuan, 2020. "Two-Agent Preemptive Pareto-Scheduling to Minimize Late Work and Other Criteria," Mathematics, MDPI, vol. 8(9), pages 1-18, September.
    10. 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.
    11. Joseph Y.-T. Leung & Michael Pinedo & Guohua Wan, 2010. "Competitive Two-Agent Scheduling and Its Applications," Operations Research, INFORMS, vol. 58(2), pages 458-469, April.
    12. Shi-Sheng Li & Jin-Jiang Yuan, 2020. "Single-machine scheduling with multi-agents to minimize total weighted late work," Journal of Scheduling, Springer, vol. 23(4), pages 497-512, August.
    13. 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.
    14. 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.
    15. 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.
    16. Rubing Chen & Jinjiang Yuan & Yuan Gao, 2019. "The complexity of CO-agent scheduling to minimize the total completion time and total number of tardy jobs," Journal of Scheduling, Springer, vol. 22(5), pages 581-593, October.
    17. S Gawiejnowicz & W-C Lee & C-L Lin & C-C Wu, 2011. "Single-machine scheduling of proportionally deteriorating jobs by two agents," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 62(11), pages 1983-1991, November.
    18. 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.
    19. Ruyan He & Jinjiang Yuan & C. T. Ng & T. C. E. Cheng, 2021. "Two-agent preemptive Pareto-scheduling to minimize the number of tardy jobs and total late work," Journal of Combinatorial Optimization, Springer, vol. 41(2), pages 504-525, February.
    20. Yunqiang Yin & Youhua Chen & Kaida Qin & Dujuan Wang, 2019. "Two-agent scheduling on unrelated parallel machines with total completion time and weighted number of tardy jobs criteria," Journal of Scheduling, Springer, vol. 22(3), pages 315-333, June.

    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. Omri Dover & Dvir Shabtay, 2016. "Single machine scheduling with two competing agents, arbitrary release dates and unit processing times," Annals of Operations Research, Springer, vol. 238(1), pages 145-178, March.
    2. Rubing Chen & Jinjiang Yuan & Yuan Gao, 2019. "The complexity of CO-agent scheduling to minimize the total completion time and total number of tardy jobs," Journal of Scheduling, Springer, vol. 22(5), pages 581-593, October.
    3. Omri Dover & Dvir Shabtay, 2016. "Single machine scheduling with two competing agents, arbitrary release dates and unit processing times," Annals of Operations Research, Springer, vol. 238(1), pages 145-178, March.
    4. Adhau, Sunil & Mittal, M.L. & Mittal, Abhinav, 2013. "A multi-agent system for decentralized multi-project scheduling with resource transfers," International Journal of Production Economics, Elsevier, vol. 146(2), pages 646-661.
    5. Wen-Hung Wu & Yunqiang Yin & T C E Cheng & Win-Chin Lin & Juei-Chao Chen & Shin-Yi Luo & Chin-Chia Wu, 2017. "A combined approach for two-agent scheduling with sum-of-processing-times-based learning effect," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 68(2), pages 111-120, February.
    6. N. Brauner & Y. Crama & A. Grigoriev & J. Klundert, 2005. "A Framework for the Complexity of High-Multiplicity Scheduling Problems," Journal of Combinatorial Optimization, Springer, vol. 9(3), pages 313-323, May.
    7. Liang Tang & Zhihong Jin & Xuwei Qin & Ke Jing, 2019. "Supply chain scheduling in a collaborative manufacturing mode: model construction and algorithm design," Annals of Operations Research, Springer, vol. 275(2), pages 685-714, April.
    8. Nong, Q.Q. & Cheng, T.C.E. & Ng, C.T., 2011. "Two-agent scheduling to minimize the total cost," European Journal of Operational Research, Elsevier, vol. 215(1), pages 39-44, November.
    9. Cheng He & Chunqi Xu & Hao Lin, 2020. "Serial-batching scheduling with two agents to minimize makespan and maximum cost," Journal of Scheduling, Springer, vol. 23(5), pages 609-617, October.
    10. Selvarajah, Esaignani & Steiner, George, 2006. "Batch scheduling in a two-level supply chain--a focus on the supplier," European Journal of Operational Research, Elsevier, vol. 173(1), pages 226-240, August.
    11. Balasubramanian, Hari & Fowler, John & Keha, Ahmet & Pfund, Michele, 2009. "Scheduling interfering job sets on parallel machines," European Journal of Operational Research, Elsevier, vol. 199(1), pages 55-67, November.
    12. 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.
    13. Vahid Nasrollahi & Ghasem Moslehi & Mohammad Reisi-Nafchi, 2022. "Minimizing the weighted sum of maximum earliness and maximum tardiness in a single-agent and two-agent form of a two-machine flow shop scheduling problem," Operational Research, Springer, vol. 22(2), pages 1403-1442, April.
    14. John J. Clifford & Marc E. Posner, 2000. "High Multiplicity in Earliness-Tardiness Scheduling," Operations Research, INFORMS, vol. 48(5), pages 788-800, October.
    15. 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.
    16. Agnetis, Alessandro & Chen, Bo & Nicosia, Gaia & Pacifici, Andrea, 2019. "Price of fairness in two-agent single-machine scheduling problems," European Journal of Operational Research, Elsevier, vol. 276(1), pages 79-87.
    17. Geng, Zhichao & Yuan, Jinjiang, 2023. "Single-machine scheduling of multiple projects with controllable processing times," European Journal of Operational Research, Elsevier, vol. 308(3), pages 1074-1090.
    18. Ruyan He & Jinjiang Yuan, 2020. "Two-Agent Preemptive Pareto-Scheduling to Minimize Late Work and Other Criteria," Mathematics, MDPI, vol. 8(9), pages 1-18, September.
    19. Yin, Yunqiang & Cheng, Shuenn-Ren & Cheng, T.C.E. & Wang, Du-Juan & Wu, Chin-Chia, 2016. "Just-in-time scheduling with two competing agents on unrelated parallel machines," Omega, Elsevier, vol. 63(C), pages 41-47.
    20. Zhichao Geng & Jiayu Liu, 0. "Single machine batch scheduling with two non-disjoint agents and splitable jobs," Journal of Combinatorial Optimization, Springer, vol. 0, pages 1-22.

    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:jcomop:v:12:y:2006:i:4:d:10.1007_s10878-006-9001-0. 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.