A constant-factor approximation algorithm for multi-vehicle collection for processing problem

DOI10.1007/S11590-012-0578-1zbMath1280.90018OpenAlexW2142195909MaRDI QIDQ376011

Eda Yücel, F. Sibel Salman, E. Lerzan Örmeci, Esma S. Gel

Publication date: 1 November 2013

Published in: Optimization Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11590-012-0578-1

zbMATH Keywords

collectionapproximation algorithmmakespanvehicle routing and scheduling

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (1)

Improving the efficiency of patient diagnostic specimen collection with the aid of a multi-modal routing algorithm

Cites Work

• Optimizing specimen collection for processing in clinical testing laboratories
• Batching and Scheduling Jobs on Batch and Discrete Processors
• The m-Traveling Salesman Problem with Minmax Objective

This page was built for publication: A constant-factor approximation algorithm for multi-vehicle collection for processing problem