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

Lili Liu (), Guochun Tang (), Baoqiang Fan () and Xingpeng Wang ()
Additional contact information
Lili Liu: Shanghai Second Polytechnic University
Guochun Tang: Shanghai Second Polytechnic University
Baoqiang Fan: Ludong University
Xingpeng Wang: Shanghai Jiaotong University

Journal of Combinatorial Optimization, 2015, vol. 30, issue 4, No 8, 938-948

Abstract: 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.

Keywords: Medication dispensing; Cooperative games; Scheduling; Dynamic programming (search for similar items in EconPapers)
Date: 2015
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (13)

Downloads: (external link)
http://link.springer.com/10.1007/s10878-015-9854-1 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v:30:y:2015:i:4:d:10.1007_s10878-015-9854-1

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1007/s10878-015-9854-1

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().