The medical laboratory scheduling for weighted flow-time
From MaRDI portal
Publication:1740398
DOI10.1007/s10878-017-0211-4zbMath1416.90010OpenAlexW2768869516MaRDI QIDQ1740398
Publication date: 30 April 2019
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-017-0211-4
Applications of mathematical programming (90C90) Deterministic scheduling theory in operations research (90B35)
Related Items (2)
Non-resumable scheduling on a single bounded parallel-batch machine with periodic maintenance ⋮ A three-stage supply chain scheduling problem based on the nursing assistants' daily work in a hospital
Cites Work
- Two-person cooperative games on scheduling problems in outpatient pharmacy dispensing process
- Patients scheduling problems with deferred deteriorated functions
- Online scheduling on unbounded parallel-batch machines to minimize the makespan
- Online scheduling on unbounded parallel-batch machines to minimize maximum flow-time
- A two-stage approach for surgery scheduling
- A best possible deterministic on-line algorithm for minimizing makespan on parallel batch machines
- On-line algorithms for minimizing makespan on batch processing machines
- Online scheduling on batching machines to minimise the total weighted completion time of jobs with precedence constraints and identical processing times
- Scheduling Nursing Personnel According to Nursing Preference: A Mathematical Programming Approach
- Nurse Scheduling Using Mathematical Programming
- Online Scheduling of a Single Machine to Minimize Total Weighted Completion Time
This page was built for publication: The medical laboratory scheduling for weighted flow-time
