Key result
A stateless two-stage scheduling method using a greedy algorithm provided practical and efficient scheduling for nuclear medicine examinations.
A novel two-stage scheduling algorithm offers an efficient solution for managing complex multiple criteria decision-making in nuclear medicine departments.
Answers are grounded in this paper and cite their sources.
May streamline nuclear medicine scheduling; leaves open prospective validation before clinical adoption.
Examination in nuclear medicine exhibits scheduling difficulties due to its intricate clinical issues, such as varied radiopharmaceuticals for different diseases, machine preparation and length of scan, and patients’ and hospital’s criteria and/or limitations. Many scheduling methods exist but are limited for nuclear medicine. In this paper, we present stateless two‐stage scheduling to cope with multiple criteria decision making. The first stage mostly deals with patients’ conditions. The second stage concerns more the clinical condition and its correlations with patients’ preference which presents more complicated intertwined configurations. A greedy algorithm is proposed in the second stage to determine the (time slot and patient) pair in linear time. The result shows practical and efficient scheduling for nuclear medicine.
No takes yet. Share an insight, caveat, or question.
Wan et al. (2014) studied Nuclear medicine scheduling. Stateless two-stage scheduling with a greedy algorithm was evaluated on Scheduling efficiency and practicality. A stateless two-stage scheduling method using a greedy algorithm provided practical and efficient scheduling for nuclear medicine examinations.
Synapse has enriched 10 related papers. Consider them for comparative context: