Minimizing labor requirements in a periodic vehicle loading problem

DOI10.1007/s10589-005-4801-1zbMath1125.90358OpenAlexW1976292308MaRDI QIDQ2490369

Cristina Delgado, Manuel Laguna, Joaquín Pacheco

Publication date: 2 May 2006

Published in: Computational Optimization and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10589-005-4801-1

zbMATH Keywords

metaheuristicsmultiprocessor schedulinglogisticsscatter searchlabor requirementsperiodic vehicle-loading problem

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Management decision making, including multiple objectives (90B50) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Production models (90B30)

Related Items

Balancing perfectly periodic service schedules: An application from recycling and waste management, Solving two location models with few facilities by using a hybrid heuristic: a real health resources case, Optimizing the periodic pick-up of raw materials for a manufacturer of auto parts, A Large Neighbourhood Search Heuristic for a Periodic Supply Vessel Planning Problem Arising in Offshore Oil and Gas Operations, Dynamic optimisation of preventative and corrective maintenance schedules for a large scale urban drainage system, Forty years of periodic vehicle routing, Memetic algorithms

Uses Software

• Scatter Search

Cites Work

• Unnamed Item
• A probabilistic heuristic for a computationally difficult set covering problem
• Improved 0/1-interchange scheduling
• Design and evaluation of tabu search algorithms for multiprocessor scheduling
• The \(k\)-partitioning problem
• A composite heuristic for the identical parallel machine scheduling problem with minimum makespan objective
• Applying tabu search with influential diversification to multiprocessor scheduling
• Greedy randomized adaptive search procedures
• An experimental evaluation of a scatter search for the linear ordering problem
• An LPT-bound for a parallel multiprocessor scheduling problem
• A linear time approximation algorithm for multiprocessor scheduling
• The period routing problem
• Fine-Tuning of Algorithms Using Fractional Experimental Designs and Local Search
• Fast Algorithms for Geometric Traveling Salesman Problems
• Algorithms for Scheduling Independent Tasks
• An Application of Bin-Packing to Multiprocessor Scheduling
• Optimal Scheduling of Tasks on Identical Parallel Processors
• Bounds on Multiprocessing Timing Anomalies