Exact and heuristic solutions to minimize total waiting time in the blood products distribution problem

DOI10.1155/2012/393890zbMath1246.90089WikidataQ58698832 ScholiaQ58698832MaRDI QIDQ447561

Mohammad Mehdi Sepehri, Amir Salehipour

Publication date: 4 September 2012

Published in: Advances in Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1155/2012/393890

Mathematics Subject Classification ID

90B50: Management decision making, including multiple objectives

90C59: Approximation methods and heuristics in mathematical programming

90B22: Queues and service in operations research

90B90: Case-oriented studies in operations research

Related Items

Bi-objective blood product scheduling under blood shortage and limited supply, A survey on the applications of variable neighborhood search algorithm in healthcare management

Cites Work

• Unnamed Item
• Optimization by Simulated Annealing
• Tabu search heuristics for the arc routing problem with intermediate facilities under capacity and length restrictions
• Delivery strategies for blood products supplies
• A new formulation for the traveling deliveryman problem
• A probabilistic heuristic for a computationally difficult set covering problem
• Greedy randomized adaptive search procedures
• Blood Inventory Management: An Overview of Theory and Practice
• Using simulation to improve the blood supply chain
• P-Complete Approximation Problems
• Variable neighborhood search for the p-median
• The Delivery Man Problem and Cumulative Matroids
• The traveling salesman problem with cumulative costs
• Variable neighborhood search: Principles and applications