Minimizing the maximal ergonomic burden in intra-hospital patient transportation
From MaRDI portal
(Redirected from Publication:1734337)
Recommendations
- Dynamic transportation of patients in hospitals
- Study on man power planning of hospital transportation department by using VRPSTW
- A tabu search heuristic for the dynamic transportation of patients between care units
- scientific article; zbMATH DE number 1594585
- The Non-Emergency Patient Transport Modelled as a Team Orienteering Problem
Cites work
- A dial-a-ride problem for client transportation in a health-care organization
- A heuristic algorithm for a dial-a-ride problem with time windows, multiple capacities, and multiple objectives
- A methodology to create robust job rotation schedules
- A reactive tabu search algorithm for the vehicle routing problem with simultaneous pickups and deliveries
- A reactive tabu search meta-heuristic for the vehicle routing problem with back-hauls
- A tabu search heuristic for the dynamic transportation of patients between care units
- A Tabu Search Heuristic for the Vehicle Routing Problem with Soft Time Windows
- An exact algorithm for parallel machine scheduling with conflicts
- An Exchange Heuristic for Routeing Problems with Time Windows
- Dynamic transportation of patients in hospitals
- Ergonomic workplace design in the fast pick area
- Heuristic Algorithms for the Handicapped Persons Transportation Problem
- scientific article; zbMATH DE number 1062113 (Why is no real title available?)
- Just-in-time scheduling. Models and algorithms for computer and manufacturing systems
- One-Processor Scheduling with Symmetric Earliness and Tardiness Penalties
- Optimal Scheduling of Tasks on Identical Parallel Processors
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Reducing ergonomic risks by job rotation scheduling
- Rich vehicle routing problems: from a taxonomy to a definition
- Scheduling with deadlines and loss functions
- Scheduling. Theory, algorithms, and systems
- Simulated annealing for parallel machine scheduling with earliness-tardiness penalties and sequence-dependent set-up times
- Single-machine scheduling with time windows and earliness/tardiness penalties
- Tabu search for single machine scheduling with distinct due windows and weighted earliness/tardiness penalties
- The dial-a-ride problem: Models and algorithms
- The pickup and delivery problem with time windows
- The Reactive Tabu Search
- The third comprehensive survey on scheduling problems with setup times/costs
- Tight bounds for the identical parallel machine scheduling problem
- Timing problems and algorithms: time decisions for sequences of activities
- Variable neighborhood search
This page was built for publication: Minimizing the maximal ergonomic burden in intra-hospital patient transportation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1734337)