An efficient genetic algorithm for job shop scheduling with tardiness objectives.

DOI10.1016/S0377-2217(03)00016-XzbMath1044.90035OpenAlexW2064542310MaRDI QIDQ1427583

Christian Bierwirth, Dirk Christian Mattfeld

Publication date: 14 March 2004

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

Full work available at URL: https://doi.org/10.1016/s0377-2217(03)00016-x

zbMATH Keywords

Genetic algorithmJob shop schedulingMulti-stage decompositionTardiness objectivesTunable schedule builder

Mathematics Subject Classification ID

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

Related Items (20)

Using a family of critical ratio-based approaches to minimize the number of tardy jobs in the job shop with sequence dependent setup times ⋮ Optimisation of fault-tolerant fabric-cutting schedules using genetic algorithms and fuzzy set theory ⋮ A comparative study of a new heuristic based on adaptive memory programming and simulated annealing: the case of job shop scheduling ⋮ On operators and search space topology in multi-objective flow shop scheduling ⋮ A simulated annealing algorithm based on block properties for the job shop scheduling problem with total weighted tardiness objective ⋮ Enhancing local search algorithms for job shops with MIN-sum objectives by approximate move evaluation ⋮ Extending capacity planning by positive lead times and optional overtime, earliness and tardiness for effective master production scheduling ⋮ A general approach for optimizing regular criteria in the job-shop scheduling problem ⋮ Minimising mean tardiness with alternative operations in two-machine flow-shop scheduling ⋮ A genetic local search algorithm for minimizing total weighted tardiness in the job-shop scheduling problem ⋮ Extended GRASP for the job shop scheduling problem with total weighted tardiness objective ⋮ Minimizing weighted tardiness of job-shop scheduling using a hybrid genetic algorithm ⋮ A PARTICLE SWARM OPTIMIZATION-BASED ALGORITHM FOR JOB-SHOP SCHEDULING PROBLEMS ⋮ A new hybrid genetic algorithm for job shop scheduling problem ⋮ A sequencing approach for creating new train timetables ⋮ A scatter search approach to sequence-dependent setup times job shop scheduling ⋮ Double layer ACO algorithm for the multi-objective FJSSP ⋮ Order acceptance using genetic algorithms ⋮ A tabu search algorithm to minimize total weighted tardiness for the job shop scheduling problem ⋮ A PARTICLE SWARM OPTIMIZATION ALGORITHM ON JOB-SHOP SCHEDULING PROBLEMS WITH MULTI-PURPOSE MACHINES

Cites Work

• Unnamed Item
• A survey of priority rule-based scheduling
• The job shop scheduling problem: Conventional and new solution techniques
• An exchange heuristic imbedded with simulated annealing for due-dates job-shop scheduling
• A search space analysis of the job shop scheduling problem
• The job shop tardiness problem: A decomposition approach
• A genetic algorithm for the job shop problem
• A large step random walk for minimizing total weighted tardiness in a job shop
• Performance enhancements to tabu search for the early/tardy scheduling problem
• A tabu search approach to machine scheduling
• The Shifting Bottleneck Procedure for Job Shop Scheduling
• New Search Spaces for Sequencing Problems with Application to Job Shop Scheduling
• A genetic algorithm methodology for complex scheduling problems
• Algorithms for Solving Production-Scheduling Problems

This page was built for publication: An efficient genetic algorithm for job shop scheduling with tardiness objectives.