Minimizing the maximal ergonomic burden in intra-hospital patient transportation
type: Item
instance of: scholarly article
title: Minimizing the maximal ergonomic burden in intra-hospital patient transportation
zbMATH Open document ID: 1430.90263
author: Alexander Fröhlich von Elmbach
author: Armin Scholl
author: Rico Walter
published in: European Journal of Operational Research
publication date: 2019-03-27T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90B06
Mathematics Subject Classification ID: 90C10
zbMATH DE Number: 7043168
zbMATH Keywords: scheduling
zbMATH Keywords: health care
zbMATH Keywords: in-house transportation
zbMATH Keywords: ergonomics
zbMATH Keywords: tabu search
describes a project that uses: HIBISCUS
describes a project that uses: Tabu search
MaRDI profile type: Publication
full work available at URL: j.ejor.2019.01.062
OpenAlex ID: W2911811967
cites work: The third comprehensive survey on scheduling problems with setup times/costs
cites work: The Reactive Tabu Search
cites work: Dynamic transportation of patients in hospitals
cites work: The dial-a-ride problem: Models and algorithms
cites work: Optimal Scheduling of Tasks on Identical Parallel Processors
cites work: The pickup and delivery problem with time windows
cites work: One-Processor Scheduling with Symmetric Earliness and Tardiness Penalties
cites work: Q4354785
cites work: Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
cites work: Tight bounds for the identical parallel machine scheduling problem
cites work: Just-in-time scheduling. Models and algorithms for computer and manufacturing systems
cites work: A tabu search heuristic for the dynamic transportation of patients between care units
cites work: Single-machine scheduling with time windows and earliness/tardiness penalties
cites work: An exact algorithm for parallel machine scheduling with conflicts
cites work: Rich vehicle routing problems: from a taxonomy to a definition
cites work: A heuristic algorithm for a dial-a-ride problem with time windows, multiple capacities, and multiple objectives
cites work: Scheduling with deadlines and loss functions
cites work: A dial-a-ride problem for client transportation in a health-care organization
cites work: Variable neighborhood search
cites work: A reactive tabu search meta-heuristic for the vehicle routing problem with back-hauls
cites work: Ergonomic workplace design in the fast pick area
cites work: Reducing ergonomic risks by job rotation scheduling
cites work: Scheduling
cites work: An Exchange Heuristic for Routeing Problems with Time Windows
cites work: Simulated annealing for parallel machine scheduling with earliness-tardiness penalties and sequence-dependent set-up times
cites work: A Tabu Search Heuristic for the Vehicle Routing Problem with Soft Time Windows
cites work: A methodology to create robust job rotation schedules
cites work: Heuristic Algorithms for the Handicapped Persons Transportation Problem
cites work: Timing problems and algorithms: Time decisions for sequences of activities
cites work: Tabu search for single machine scheduling with distinct due windows and weighted earliness/tardiness penalties
cites work: A reactive tabu search algorithm for the vehicle routing problem with simultaneous pickups and deliveries
Wikidata QID: Q128439469
DOI: 10.1016/J.EJOR.2019.01.062
description: scientific article; zbMATH DE number 7043168