A memetic algorithm for the total tardiness single machine scheduling problem

DOI10.1016/S0377-2217(00)00140-5zbMath0996.90042OpenAlexW2090826610WikidataQ58072486 ScholiaQ58072486MaRDI QIDQ5938406

Paulo Morelato França, Alexandre Mendes, Pablo Moscato

Publication date: 18 July 2001

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

Full work available at URL: https://doi.org/10.1016/s0377-2217(00)00140-5

zbMATH Keywords

genetic algorithmhybrid genetic algorithmsmemetic algorithmsequence-dependent setup timestotal tardiness single machine scheduling

Mathematics Subject Classification ID

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

Related Items (28)

A memetic algorithm for minimizing the total weighted completion time on a single machine under step-deterioration ⋮ Using a family of critical ratio-based approaches to minimize the number of tardy jobs in the job shop with sequence dependent setup times ⋮ A genetic algorithm/mathematical programming approach to solve a two-level soft drink production problem ⋮ A study of hybrid evolutionary algorithms for single machine scheduling problem with sequence-dependent setup times ⋮ An exact algorithm for the single-machine total weighted tardiness problem with sequence-dependent setup times ⋮ Mathematical programming-based approaches for multi-facility Glass container production planning ⋮ Parallel machine total tardiness scheduling with a new hybrid metaheuristic approach ⋮ On the mass COVID-19 vaccination scheduling problem ⋮ A memetic algorithm for minimizing the total weighted completion time on a single machine under linear deterioration ⋮ Global optimization using a genetic algorithm with hierarchically structured population ⋮ Iterated local search for single-machine scheduling with sequence-dependent setup times to minimize total weighted tardiness ⋮ Neighborhood search procedures for single machine tardiness scheduling with sequence-dependent setups ⋮ Algorithms for single machine total tardiness scheduling with sequence dependent setups ⋮ A GRASP based on DE to solve single machine scheduling problem with SDST ⋮ ILS heuristics for the single-machine scheduling problem with sequence-dependent family setup times to minimize total tardiness ⋮ A survey of scheduling problems with setup times or costs ⋮ A multiple-population evolutionary approach to gate matrix layout ⋮ A hybrid genetic algorithm for the single machine scheduling problem with sequence-dependent setup times ⋮ A heuristic approach for a scheduling problem with periodic maintenance and sequence-dependent setup times ⋮ Multi-population genetic algorithm to solve the synchronized and integrated two-level lot sizing and scheduling problem ⋮ A memetic algorithm for minimizing total weighted tardiness on parallel batch machines with incompatible job families and dynamic job arrival ⋮ A bicriteria scheduling with sequence-dependent setup times ⋮ A discrete differential evolution algorithm for the single machine total weighted tardiness problem with sequence dependent setup times ⋮ Algorithms for special cases of the single machine total tardiness problem and an application to the even-odd partition problem ⋮ A new discrete particle swarm optimization approach for the single-machine total weighted tardiness scheduling problem with sequence-dependent setup times ⋮ Constraint ordinal optimization ⋮ A unified heuristic and an annotated bibliography for a large class of earliness-tardiness scheduling problems ⋮ Order assignment and scheduling under processing and distribution time uncertainty

Cites Work

• Unnamed Item
• Unnamed Item
• Real-time scheduling of an automated manufacturing center
• Scheduling in a sequence dependent setup environment with genetic search
• Scatter search and star-paths: Beyond the genetic metaphor
• An introduction to population approaches for optimization and hierarchical objective functions: A discussion on the role of tabu search
• Minimizing Total Tardiness on One Machine is NP-Hard
• Sequencing with Earliness and Tardiness Penalties: A Review
• A Review of Production Scheduling
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• The Total Tardiness Problem: Review and Extensions

This page was built for publication: A memetic algorithm for the total tardiness single machine scheduling problem