Solving a concrete sleepers production scheduling by genetic algorithms

DOI10.1016/j.ejor.2005.03.070zbMath1144.90395OpenAlexW2062578219MaRDI QIDQ863974

M. E. Pérez-Vázquez, A. M. Gento-Municio, Helena R. Lourenço

Publication date: 12 February 2007

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/10230/45918

zbMATH Keywords

schedulinggenetic algorithmsmultiobjectivedeterministic crowding

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (2)

FUZZY LINEAR PROGRAMMING APPROACH TO MULTI-ATTRIBUTE DECISION-MAKING WITH LINGUISTIC VARIABLES AND INCOMPLETE INFORMATION ⋮ Recent trends indicate rapid growth of nature-inspired optimization in academia and industry

Uses Software

• Genocop
• Tabu search

Cites Work

• Optimization by Simulated Annealing
• Job Shop Scheduling by Simulated Annealing
• An effective hybrid optimization strategy for job-shop scheduling problems
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Solving a concrete sleepers production scheduling by genetic algorithms