Comparing efficiencies of genetic crossover operators for one machine total weighted tardiness problem

DOI10.1016/j.amc.2007.10.013zbMath1140.90402OpenAlexW2051292962MaRDI QIDQ928082

John M. Wilson, Talip Kellegöz, Bilal Toklu

Publication date: 11 June 2008

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2007.10.013

zbMATH Keywords

genetic algorithmstotal weighted tardinesscrossover operatorsone-machine scheduling

Mathematics Subject Classification ID

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

Related Items

Hybrid tabu search and a truncated branch-and-bound for the unrelated parallel machine scheduling problem, A COMPARATIVE STUDY ON PARTICLE SWARM OPTIMIZATION AND GENETIC ALGORITHMS FOR TRAVELING SALESMAN PROBLEMS, Single CNC machine scheduling with controllable processing times to minimize total weighted tardiness, Hybrid evolutionary algorithm with optimized operators for total weighted tardiness problem, Hybrid evolutionary search for the traveling repairman problem with profits, The computing of the optimal power consumption for semi-track air-cushion vehicle using hybrid generalized extremal optimization, A hybrid genetic algorithm for the single machine maximum lateness problem with release times and family setups, Scheduling steel plates on a roller furnace, The role of crossover operator in the genetic optimization of magnetic models, Metaheuristics for a scheduling problem with rejection and tardiness penalties, A HYBRID METAHEURISTIC FOR THE SINGLE-MACHINE TOTAL WEIGHTED TARDINESS PROBLEM, A new crossover approach for solving the multiple travelling salesmen problem using genetic algorithms, Optimization of job shop scheduling problems using teaching-learning-based optimization algorithm

Cites Work

• A new lower bounding scheme for the total weighted tardiness problem.
• Evolutionary optimization.
• An enhanced dynasearch neighborhood for the single-machine total weighted tardiness scheduling problem
• Single machine scheduling to minimize total weighted tardiness
• A decomposition algorithm for the single machine total tardiness problem
• An Iterated Dynasearch Algorithm for the Single-Machine Total Weighted Tardiness Scheduling Problem
• Minimizing Total Costs in One-Machine Scheduling
• A dual algorithm for the one-machine scheduling problem
• Local Search Heuristics for the Single Machine Total Weighted Tardiness Scheduling Problem
• A fast ant-colony algorithm for single-machine scheduling to minimize the sum of weighted tardiness of jobs
• One-Machine Sequencing to Minimize Certain Functions of Job Tardiness
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item