Two-stage medical supply chain scheduling with an assignable common due window and shelf life

This paper considers a two-stage medical supply chain scheduling problem from the perspective of the medicine manufacturer in which jobs have an assignable common due window and shelf life. Each job will incur an early (tardy) penalty if it is early (tardy) with respect to the common due window unde...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Journal of combinatorial optimization Ročník 37; číslo 1; s. 319 - 329
Hlavní autoři: Zhang, Long, Zhang, Yuzhong, Bai, Qingguo
Médium: Journal Article
Jazyk:angličtina
Vydáno: New York Springer US 01.01.2019
Springer Nature B.V
Témata:
Combinatorics
Completion time
Convex and Discrete Geometry
Job shops
Mathematical Modeling and Industrial Mathematics
Mathematics
Mathematics and Statistics
Medical supplies
Operations Research/Decision Theory
Optimization
Polynomials
Production scheduling
Scheduling
Shelf life
Supply chains
Theory of Computation
Windows (intervals)
Medical supply chain scheduling
Shelf life
hard
Pseudo-polynomial-time algorithm
Due window assignment
ISSN:1382-6905, 1573-2886
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:This paper considers a two-stage medical supply chain scheduling problem from the perspective of the medicine manufacturer in which jobs have an assignable common due window and shelf life. Each job will incur an early (tardy) penalty if it is early (tardy) with respect to the common due window under a given schedule. The job’s holding time, which is the time interval that passes from the completion time of the job to the delivery date of the job in the batch, must be no more than its shelf life. The objective is to minimize the total cost comprising earliness, weighted number of tardy jobs, holding time, due window starting time, window size, and batch delivery. We first show that the problem is NP -hard and then provide a pseudo-polynomial-time algorithm. We also prove that a special case of the problem can be optimally solved in polynomial time.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1382-6905
1573-2886
DOI:10.1007/s10878-017-0228-8