Surgical case scheduling as a generalized job shop scheduling problem
From MaRDI portal
Publication:2464181
DOI10.1016/j.ejor.2006.03.059zbMath1146.90420MaRDI QIDQ2464181
Dinh Nguyen Pham, Andreas Klinkert
Publication date: 10 December 2007
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2006.03.059
job insertion; OR in health services; surgical case scheduling; blocking job shop; multimode job shop
90B35: Deterministic scheduling theory in operations research
Related Items
Scheduling elective surgery under uncertainty and downstream capacity constraints, Complete local search with limited memory algorithm for no-wait job shops to minimize makespan, Operating room planning and scheduling: a literature review, Non-block scheduling with priority for radiotherapy treatments, Erlang loss bounds for OT-ICU systems
Uses Software
Cites Work
- A branch-and-bound algorithm to minimize the makespan in a flowshop with blocking
- Practical job shop scheduling
- Multi-resource shop scheduling with resource flexibility
- An integrated approach for modeling and solving the general multiprocessor job-shop scheduling problem using tabu search
- Tabu-search for the multi-mode job-shop problem
- Scheduling multipurpose batch process industries with no-wait restrictions by simulated annealing
- Deterministic job-shop scheduling: Past, present and future
- Job-shop scheduling with blocking and no-wait constraints
- Shop scheduling problems with multiprocessor tasks on dedicated processors
- Effective neighbourhood functions for the flexible job shop problem
- Scheduling surgical procedures
- Scheduling patients in an ambulatory surgical center