Minimizing labor requirements in a periodic vehicle loading problem

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

Manuel Laguna, Joaquín Pacheco, Cristina Delgado

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

metaheuristics; multiprocessor scheduling; logistics; scatter search; labor requirements; periodic vehicle-loading problem

Mathematics Subject Classification ID

90C90: Applications of mathematical programming

90B50: Management decision making, including multiple objectives

90B35: Deterministic scheduling theory in operations research

90C59: Approximation methods and heuristics in mathematical programming

90B30: Production models

Related Items

Optimizing the periodic pick-up of raw materials for a manufacturer of auto parts, Solving two location models with few facilities by using a hybrid heuristic: a real health resources case, 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