A three-stage supply chain scheduling problem based on the nursing assistants' daily work in a hospital

DOI10.1007/s10878-019-00500-3zbMath1483.90053MaRDI QIDQ2060064

Jing Fan, Hui Shi

Publication date: 13 December 2021

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-019-00500-3

zbMATH Keywords

approximation algorithm; strongly NP-hard; three-stage supply chain scheduling problem

Mathematics Subject Classification ID

90B35: Deterministic scheduling theory in operations research

90B05: Inventory, storage, reservoirs

68W25: Approximation algorithms

Cites Work

• Supply chain scheduling problem in the hospital with periodic working time on a single machine
• Production scheduling with supply and delivery considerations to minimize the makespan
• Study on specialist outpatient matching appointment and the balance matching model
• The medical laboratory scheduling for weighted flow-time
• Online scheduling for outpatient services with heterogeneous patients and physicians
• Real-time scheduling optimization considering the unexpected events in home health care
• Three-sided stable matching problem with two of them as cooperative partners
• Two-stage medical supply chain scheduling with an assignable common due window and shelf life
• Three-dimensional stable matching with hybrid preferences
• Two-machine flowshop scheduling in a physical examination center
• A two-stage approach for surgery scheduling
• Integrated Production and Outbound Distribution Scheduling: Review and Extensions
• Supply Chain Scheduling: Batching and Delivery
• Machine scheduling with pickup and delivery