Supply chain scheduling problem in the hospital with periodic working time on a single machine

Jing Fan () and Xiwen Lu ()
Additional contact information
Jing Fan: East China University of Science and Technology
Xiwen Lu: East China University of Science and Technology

Journal of Combinatorial Optimization, 2015, vol. 30, issue 4, No 5, 892-905

Abstract: Abstract The warehouse of a hospital is responsible for wrapping medical materials into packages by a baler and dispatching packages to the departments of the hospital periodically to guarantee the requirements of patients. The manager of the warehouse wants to efficiently utilize the wrapping machine and reduce the times of distributions to decrease logistics cost. If we regard the baler as a single machine and medical materials as jobs, the problem can be summarized as a supply chain scheduling problem integrated with production and delivery. Owing to periodic working time of workers, the machine can be viewed as having periodic maintenance. Because the wrapping interruption of medical materials is not allowed in the hospital, processing of any job is nonresumable. All wrapped packages are dispatched before workers are off duty. This means that each delivery batch is delivered just before each maintenance. Our goal is to minimize sum of the total delivery time and the total delivery cost. We show that the problem is strongly NP-hard and provide a $$2$$ 2 -approximation algorithm. Moreover, we propose a branch-and-bound algorithm. Finally we present computational results for some instances generated randomly. Numerical simulation results show that the approximation algorithm performs efficiently.

Keywords: Supply chain scheduling; Periodic maintenance; Nonresumable job; Approximation algorithm; Branch-and-bound algorithm (search for similar items in EconPapers)
Date: 2015
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (12)

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

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

DOI: 10.1007/s10878-015-9857-y

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