Minimizing the maximal ergonomic burden in intra-hospital patient transportation

DOI10.1016/j.ejor.2019.01.062zbMath1430.90263OpenAlexW2911811967WikidataQ128439469 ScholiaQ128439469MaRDI QIDQ1734337

Rico Walter, Alexander Fröhlich von Elmbach, Armin Scholl

Publication date: 27 March 2019

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2019.01.062

zbMATH Keywords

schedulingtabu searchhealth careergonomicsin-house transportation

Mathematics Subject Classification ID

Integer programming (90C10) Transportation, logistics and supply chain management (90B06) Deterministic scheduling theory in operations research (90B35)

Uses Software

• Tabu search
• HIBISCUS

Cites Work

• Unnamed Item
• Rich vehicle routing problems: from a taxonomy to a definition
• The third comprehensive survey on scheduling problems with setup times/costs
• A reactive tabu search algorithm for the vehicle routing problem with simultaneous pickups and deliveries
• The pickup and delivery problem with time windows
• Single-machine scheduling with time windows and earliness/tardiness penalties
• Variable neighborhood search
• A reactive tabu search meta-heuristic for the vehicle routing problem with back-hauls
• Ergonomic workplace design in the fast pick area
• Tabu search for single machine scheduling with distinct due windows and weighted earliness/tardiness penalties
• A heuristic algorithm for a dial-a-ride problem with time windows, multiple capacities, and multiple objectives
• Dynamic transportation of patients in hospitals
• A tabu search heuristic for the dynamic transportation of patients between care units
• Reducing ergonomic risks by job rotation scheduling
• An exact algorithm for parallel machine scheduling with conflicts
• A dial-a-ride problem for client transportation in a health-care organization
• A methodology to create robust job rotation schedules
• The dial-a-ride problem: Models and algorithms
• Just-in-time scheduling. Models and algorithms for computer and manufacturing systems
• Scheduling with Deadlines and Loss Functions
• Tight bounds for the identical parallel machine scheduling problem
• One-Processor Scheduling with Symmetric Earliness and Tardiness Penalties
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• The Reactive Tabu Search
• A Tabu Search Heuristic for the Vehicle Routing Problem with Soft Time Windows
• Heuristic Algorithms for the Handicapped Persons Transportation Problem
• Simulated annealing for parallel machine scheduling with earliness-tardiness penalties and sequence-dependent set-up times
• Timing problems and algorithms: Time decisions for sequences of activities
• An Exchange Heuristic for Routeing Problems with Time Windows
• Optimal Scheduling of Tasks on Identical Parallel Processors
• Scheduling

This page was built for publication: Minimizing the maximal ergonomic burden in intra-hospital patient transportation