A HYBRID GENETIC ALGORITHM FOR THE EARLY/TARDY SCHEDULING PROBLEM

DOI10.1142/S0217595906000978zbMath1103.90050MaRDI QIDQ5487850

Jorge M. S. Valente, José Fernando Gonçalves, Rui A. F. S. Alves

Publication date: 12 September 2006

Published in: Asia-Pacific Journal of Operational Research (Search for Journal in Brave)

zbMATH Keywords

heuristicsschedulinggenetic algorithmsrandom keysearly/tardy

Mathematics Subject Classification ID

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

Related Items

Biased random-key genetic algorithms with applications in telecommunications ⋮ Grain Price Forecasting Using a Hybrid Stochastic Method

Cites Work

• Unnamed Item
• A branch-and-bound algorithm for the single machine earliness and tardiness scheduling problem
• A greedy genetic algorithm for the quadratic assignment problem
• Improved heuristics for the early/tardy scheduling problem with no idle time
• Sequencing with Earliness and Tardiness Penalties: A Review
• Dynamic Programming State-Space Relaxation for Single-Machine Scheduling
• The Single Machine Early/Tardy Problem
• Genetic Algorithms and Random Keys for Sequencing and Optimization
• Improved lower bounds for the early/tardy scheduling problem with no idle time
• On the use of genetic algorithms to solve location problems

This page was built for publication: A HYBRID GENETIC ALGORITHM FOR THE EARLY/TARDY SCHEDULING PROBLEM