Heuristic algorithms for a complex parallel machine scheduling problem

DOI10.1007/s10100-008-0066-yzbMath1162.90445OpenAlexW2072660091MaRDI QIDQ1022398

Csanád Imreh, Zoltán Kovács, Zoltán L. Blázsik

Publication date: 22 June 2009

Published in: CEJOR. Central European Journal of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10100-008-0066-y

zbMATH Keywords

schedulingvehicle routingheuristic algorithms

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Related Items

A heuristic framework on a common generalization of the vehicle routing problem and the linear ordering problem ⋮ Merging image databases as an example for information integration

Cites Work

• A branch-and-bound procedure to minimize total tardiness on one machine with arbitrary release dates
• Scheduling on parallel identical machines to minimize total tardiness
• An exact algorithm for a single-vehicle routing problem with time windows and multiple routes
• The vehicle routing problem with flexible time windows and traveling times
• Scheduling multiprocessor tasks -- An overview
• The traveling salesman problem and its variations
• Vehicle routing problem with time windows and a limited number of vehicles.