IDEAS home Printed from https://ideas.repec.org/a/spr/jcomop/v30y2015i4d10.1007_s10878-015-9854-1.html
   My bibliography  Save this article

Two-person cooperative games on scheduling problems in outpatient pharmacy dispensing process

Author

Listed:
  • Lili Liu

    (Shanghai Second Polytechnic University)

  • Guochun Tang

    (Shanghai Second Polytechnic University)

  • Baoqiang Fan

    (Ludong University)

  • Xingpeng Wang

    (Shanghai Jiaotong University)

Abstract

This paper considers two-person cooperative games on scheduling problem which is motivated by the medication dispensing at outpatient pharmacies. We prove that two-person cooperative games on minimizing the number of tardy jobs is NP-hard, and two-person cooperative games on minimizing the total weighted number of tardy jobs and on minimizing the total weighted completion time are NP-hard even if the jobs have the same processing times. We develop dynamic programming algorithms for problems of two-person cooperative games on minimizing the total (weighted) number of tardy jobs and on minimizing the total (weighted) completion time respectively, which run in pseudo-polynomial time and indicate that they are binary NP-hard.

Suggested Citation

  • Lili Liu & Guochun Tang & Baoqiang Fan & Xingpeng Wang, 2015. "Two-person cooperative games on scheduling problems in outpatient pharmacy dispensing process," Journal of Combinatorial Optimization, Springer, vol. 30(4), pages 938-948, November.
    • Handle: RePEc:spr:jcomop:v:30:y:2015:i:4:d:10.1007_s10878-015-9854-1
    DOI: 10.1007/s10878-015-9854-1
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10878-015-9854-1
    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-015-9854-1?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. Nash, John, 1953. "Two-Person Cooperative Games," Econometrica, Econometric Society, vol. 21(1), pages 128-140, April.
    2. Wayne E. Smith, 1956. "Various optimizers for single‐stage production," Naval Research Logistics Quarterly, John Wiley & Sons, vol. 3(1‐2), pages 59-66, March.
    3. Nash, John, 1950. "The Bargaining Problem," Econometrica, Econometric Society, vol. 18(2), pages 155-162, April.
    4. Yanhong Gu & Jing Fan & Guochun Tang & Jiaofei Zhong, 2013. "Maximum latency scheduling problem on two-person cooperative games," Journal of Combinatorial Optimization, Springer, vol. 26(1), pages 71-81, July.
    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. Lu Liu & Chun Wang & Jianjun Wang, 2019. "A combinatorial auction mechanism for surgical scheduling considering surgeon’s private availability information," Journal of Combinatorial Optimization, Springer, vol. 37(1), pages 405-417, January.
    2. Gengjun Gao & Yuxuan Che & Jian Shen, 0. "Path optimization for joint distribution of medical consumables under hospital SPD supply chain mode," Journal of Combinatorial Optimization, Springer, vol. 0, pages 1-18.
    3. J. Behnamian & Z. Gharabaghli, 2023. "Multi-objective outpatient scheduling in health centers considering resource constraints and service quality: a robust optimization approach," Journal of Combinatorial Optimization, Springer, vol. 45(2), pages 1-35, March.
    4. Wenhua Li & Xing Chai, 2019. "The medical laboratory scheduling for weighted flow-time," Journal of Combinatorial Optimization, Springer, vol. 37(1), pages 83-94, January.
    5. Gang Du & Luyao Zheng & Xiaoling Ouyang, 2019. "Real-time scheduling optimization considering the unexpected events in home health care," Journal of Combinatorial Optimization, Springer, vol. 37(1), pages 196-220, January.
    6. Peng Liu & Xiaoli Wang, 2017. "Maximum Lateness Scheduling on Two-Person Cooperative Games with Variable Processing Times and Common Due Date," Journal of Optimization, Hindawi, vol. 2017, pages 1-7, April.
    7. Huidan Lin & Qun Li & Xueguo Xu & Ying Zhang, 0. "Research on dispatch of drugs and consumables in SPD warehouse of large scale hospital under uncertain environment: take respiratory consumables as an example," Journal of Combinatorial Optimization, Springer, vol. 0, pages 1-18.
    8. Gengjun Gao & Yuxuan Che & Jian Shen, 2021. "Path optimization for joint distribution of medical consumables under hospital SPD supply chain mode," Journal of Combinatorial Optimization, Springer, vol. 42(4), pages 866-883, November.
    9. Huidan Lin & Qun Li & Xueguo Xu & Ying Zhang, 2021. "Research on dispatch of drugs and consumables in SPD warehouse of large scale hospital under uncertain environment: take respiratory consumables as an example," Journal of Combinatorial Optimization, Springer, vol. 42(4), pages 848-865, November.
    10. He Huang & Wei Gao & Chunming Ye, 0. "An intelligent data-driven model for disease diagnosis based on machine learning theory," Journal of Combinatorial Optimization, Springer, vol. 0, pages 1-12.
    11. Long Zhang & Yuzhong Zhang & Qingguo Bai, 2019. "Two-stage medical supply chain scheduling with an assignable common due window and shelf life," Journal of Combinatorial Optimization, Springer, vol. 37(1), pages 319-329, January.
    12. He Huang & Wei Gao & Chunming Ye, 2021. "An intelligent data-driven model for disease diagnosis based on machine learning theory," Journal of Combinatorial Optimization, Springer, vol. 42(4), pages 884-895, November.
    13. Bowen Jiang & Jiafu Tang & Chongjun Yan, 2019. "A comparison of fixed and variable capacity-addition policies for outpatient capacity allocation," Journal of Combinatorial Optimization, Springer, vol. 37(1), pages 150-182, January.

    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. Guth, Werner & Ritzberger, Klaus & van Damme, Eric, 2004. "On the Nash bargaining solution with noise," European Economic Review, Elsevier, vol. 48(3), pages 697-713, June.
    2. Dinar, Ariel, 1989. "Application of the Nash Bargaining Model to a Problem of Efficient Resources Use and Cost-Benefit Allocation," 1989 Annual Meeting, July 30-August 2, Baton Rouge, Louisiana 270685, American Agricultural Economics Association (New Name 2008: Agricultural and Applied Economics Association).
    3. Volodymyr Babich & Simone Marinesi & Gerry Tsoukalas, 2021. "Does Crowdfunding Benefit Entrepreneurs and Venture Capital Investors?," Manufacturing & Service Operations Management, INFORMS, vol. 23(2), pages 508-524, March.
    4. Ley, Eduardo, 2006. "Statistical inference as a bargaining game," Economics Letters, Elsevier, vol. 93(1), pages 142-149, October.
    5. Yu, Shasha & Lei, Ming & Deng, Honghui, 2023. "Evaluation to fixed-sum-outputs DMUs by non-oriented equilibrium efficient frontier DEA approach with Nash bargaining-based selection," Omega, Elsevier, vol. 115(C).
    6. repec:eee:labchp:v:2:y:1986:i:c:p:1039-1089 is not listed on IDEAS
    7. Yashiv, Eran, 2007. "Labor search and matching in macroeconomics," European Economic Review, Elsevier, vol. 51(8), pages 1859-1895, November.
    8. Güth, Werner, 1998. "Sequential versus independent commitment: An indirect evolutionary analysis of bargaining rules," SFB 373 Discussion Papers 1998,5, Humboldt University of Berlin, Interdisciplinary Research Project 373: Quantification and Simulation of Economic Processes.
    9. Iraklis Kollias & John Leventides & Vassilios G. Papavassiliou, 2024. "On the solution of games with arbitrary payoffs: An application to an over‐the‐counter financial market," International Journal of Finance & Economics, John Wiley & Sons, Ltd., vol. 29(2), pages 1877-1895, April.
    10. van Damme, E.E.C., 2000. "John Nash and the analysis of rational behavior," Other publications TiSEM cf34a879-fd1c-4588-9646-7, Tilburg University, School of Economics and Management.
    11. Takeuchi, Ai & Veszteg, Róbert F. & Kamijo, Yoshio & Funaki, Yukihiko, 2022. "Bargaining over a jointly produced pie: The effect of the production function on bargaining outcomes," Games and Economic Behavior, Elsevier, vol. 134(C), pages 169-198.
    12. Naeve-Steinweg, Elisabeth, 2002. "Mechanisms supporting the Kalai-Smorodinsky solution," Mathematical Social Sciences, Elsevier, vol. 44(1), pages 25-36, September.
    13. Hwang, Sung-Ha & Rey-Bellet, Luc, 2021. "Positive feedback in coordination games: Stochastic evolutionary dynamics and the logit choice rule," Games and Economic Behavior, Elsevier, vol. 126(C), pages 355-373.
    14. Vesa Kanniainen & Juha-Matti Lehtonen, 2019. "Offset Contracts as an Insurance Device in Building the National Security," Defence and Peace Economics, Taylor & Francis Journals, vol. 30(1), pages 85-97, January.
    15. Eric van Damme & Xu Lang, 2022. "Two-Person Bargaining when the Disagreement Point is Private Information," Papers 2211.06830, arXiv.org, revised Jan 2024.
    16. Anbarci, Nejat & Skaperdas, Stergios & Syropoulos, Constantinos, 2002. "Comparing Bargaining Solutions in the Shadow of Conflict: How Norms against Threats Can Have Real Effects," Journal of Economic Theory, Elsevier, vol. 106(1), pages 1-16, September.
    17. Cédric Wanko, 2008. "Approche Conceptuelle et Algorithmique des Equilibres de Nash Robustes Incitatifs," Working Papers 08-03, LAMETA, Universtiy of Montpellier, revised Feb 2008.
    18. Felipe Maciel Cardoso & Carlos Gracia-Lázaro & Frederic Moisan & Sanjeev Goyal & Angel Sánchez & Yamir Moreno, 2020. "Effect of Network Topology and Node Centrality on Trading," Post-Print hal-03188212, HAL.
    19. Jacob Engwerda & Davoud Mahmoudinia & Rahim Dalali Isfahani, 2016. "Government and Central Bank Interaction under Uncertainty: A Differential Games Approach," Iranian Economic Review (IER), Faculty of Economics,University of Tehran.Tehran,Iran, vol. 20(2), pages 225-259, Spring.
    20. Vincent Martinet & Pedro Gajardo & Michel De Lara & Héctor Ramírez Cabrera, 2011. "Bargaining with intertemporal maximin payoffs," EconomiX Working Papers 2011-7, University of Paris Nanterre, EconomiX.
    21. R. Harrison Wagner, 1979. "On The Unification of Two-Person Bargaining Theory," Journal of Conflict Resolution, Peace Science Society (International), vol. 23(1), pages 71-101, March.

    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:30:y:2015:i:4:d:10.1007_s10878-015-9854-1. 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.