Patients scheduling problems with deferred deteriorated functions

Xingong Zhang (), Hui Wang () and Xingpeng Wang ()
Additional contact information
Xingong Zhang: Chongqing Normal University
Hui Wang: Chongqing Normal University
Xingpeng Wang: Shanghai Jiaotong University

Journal of Combinatorial Optimization, 2015, vol. 30, issue 4, No 14, 1027-1041

Abstract: Abstract In the survey scheduling theory, if a surgical patient is regarded as a job waiting to be processed, and the anesthesiologist care unit nurses as machines that are needed before the survey. Due to the lack of operating rooms or the accidental extension of operation time, the patients will have a longer wait time, and can not do operation following the effects of the anaesthetic. The patient needs to be re-anesthesia so that the effects are required to undergo surgery. But this will cause operation time prolonged. Based on the performance of medical procedures under deteriorating health conditions, this paper presents a deterministic approach to schedule patients in surgery scheduling problems with the deferred parameter. We take the patients as jobs. By the deferred deteriorating effect, it means that the actual processing time of a job is a function of its starting time and a control parameter. We prove that the classical SPT (the shortest processing time) rule remains optimal when we minimize the makespan or the total completion time. For problems of minimizing the total weighted completion time and the maximum lateness, we present heuristic sequencing rules and analyze the worst-case bounds for performance ratios. We also show that these heuristic rules can be optimal under some agreeable conditions between the normal processing times and job due dates or weights.

Keywords: Scheduling; Single-machine; Deteriorated jobs; Worst-case bounds; Surgical resource utilization (search for similar items in EconPapers)
Date: 2015
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (6)

Downloads: (external link)
http://link.springer.com/10.1007/s10878-015-9852-3 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-9852-3

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

DOI: 10.1007/s10878-015-9852-3

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 ().