# MEMETIC ALGORITHMS TO MINIMIZE TARDINESS ON A SINGLE MACHINE WITH SEQUENCE-DEPENDENT SETUP TIMES

@inproceedings{Frana1999MEMETICAT, title={MEMETIC ALGORITHMS TO MINIMIZE TARDINESS ON A SINGLE MACHINE WITH SEQUENCE-DEPENDENT SETUP TIMES}, author={P. França and Alexandre Mendes and P. Moscato}, year={1999} }

The Single Machine Scheduling (SMS) problem is one of the most representative problems in the scheduling area. In this paper, we explore the SMS with time constraints (setup times and due-dates) and the objective function is the minimization of total tardiness. The chosen method is based on a hybrid-genetic algorithm, which belongs to the memetic algorithms class. Results are compared against genetic algorithms , multiple start , the constructive heuristic ATCS proposed by Lee et al. (1997) and… Expand

#### 16 Citations

Comparing meta-heuristic approaches for parallel machine scheduling problems

- Computer Science
- 1999

This paper compares the performance of two meta-heuristic methods proposed to solve the identical parallel machine scheduling problem with sequence dependent setup times by combining a population-based method with local search procedures. Expand

Cutting path as a Rural Postman Problem: solutions by Memetic Algorithms

- Mathematics, Computer Science
- Int. J. Comb. Optim. Probl. Informatics
- 2012

This paper introduces an original approach based on Memetic Algorithms - the MARP algorithm - to solve the RPP and, also deals with an interesting Industrial Application, which focuses on the path optimization for component cutting operations. Expand

Particle swarm optimization for sequencing problems: a case study

- Computer Science
- Proceedings of the 2004 Congress on Evolutionary Computation (IEEE Cat. No.04TH8753)
- 2004

A hybrid particle swarm optimizer that incorporates a random key representation for particles and a dynamic mutation operator similar to those used in evolutionary algorithm was designed with permutation problems. Expand

Memetic Algorithms in Planning, Scheduling, and Timetabling

- Engineering, Computer Science
- Evolutionary Scheduling
- 2007

The basic architecture of a MAs is described, and some guidelines to the design of a successful MA for these applications are presented, as well as some reflections on the lessons learned, and the future directions that research could take in this area. Expand

A Multi-objective Memetic Algorithm for probabilistic transmission network expansion planning

- Computer Science
- 2010 IEEE International Conference on Systems, Man and Cybernetics
- 2010

A new method for TNEP with MOMA that combines Multi-objective meta-heuristics (MOMH) with Tabu Search (TS) to obtain better solution sets to improve power supply reliability with probabilistic approaches is proposed. Expand

Probabilistic distribution network expansion planning with multi-objective Memetic Algorithm

- Engineering
- 2008 IEEE Canada Electric Power Conference
- 2008

This paper presents an efficient method for probabilistic distribution network expansion planning with Multi-objective Memetic Algorithm (MOMA) that combines Multi-objective GA with LS (local… Expand

A new multi-objective meta-heuristics for distribution network reconfigurations with SVRs

- Computer Science
- 2010 IEEE International Conference on Systems, Man and Cybernetics
- 2010

This paper presents a new efficient method for network reconfigurations with step voltage regulators (SVRs) in distribution networks that combines with REX* and a tabu-search-based method and has higher performance method in comparison with conventional MOMH. Expand

An Introduction to Memetic Algorithms

- Computer Science
- 2003

This work shows the general structure of MAs, and provides some guidelines for their design, and an overview of the numerous applications of these techniques is presented. Expand

Memetic Algorithms

- Computer Science
- Handbook of Approximation Algorithms and Metaheuristics
- 2007

The term ‘Memetic Algorithms’ [74] (MAs) was introduced in the late 80s to denote a family of metaheuristics that have as central theme the hybridization of different algorithmic approaches for a… Expand

A Gentle Introduction to Memetic Algorithms

- Computer Science
- Handbook of Metaheuristics
- 2003

The generic denomination of ‘Memetic Algorithms’ (MAs) is used to encompass a broad class of metaheuristics (i.e. general purpose methods aimed to guide an underlying heuristic) and proved to be of practical success in a variety of problem domains and in particular for the approximate solution of NP Optimization problems. Expand

#### References

SHOWING 1-10 OF 11 REFERENCES

A heuristic to minimize the total weighted tardiness with sequence-dependent setups

- Engineering
- 1997

We propose a three-phase heuristic for the problem of minimizing the total weighted tardiness on a single machine in the presence of sequence-dependent setup times. In the first phase a number of… Expand

Minimizing Tardiness on a Single Processor with Sequence Dependent Setup Times: A Simulated Annealing Approach

- Computer Science
- 1997

Simulated annealing was used to solve the sequencing problem, and its performance was compared with random search, and ways in which more complex and realistic job shop environments, such as multiple machines with a higher number of jobs in the sequence, and other scheduling objectives can be modeled are suggested. Expand

Scheduling in a sequence dependent setup environment with genetic search

- Computer Science
- Comput. Oper. Res.
- 1995

This work examines the efficacy of using genetic search to develop near optimal schedules in a single-stage process where setup times are sequence dependent. Expand

The single machine early/tardy problem

- Computer Science
- 1989

A variation of the Beam Search method, called Filtered Beam Search, is proposed, able to use priority functions to search a number of solution paths in parallel and was not only efficient but also consistent in providing near-optimal solutions with a relatively small search tree. Expand

Parallel machine scheduling problems using memetic algorithms

- Computer Science
- 1997

Preliminary computational experiments demonstrate that the hybrid genetic algorithm outperforms the genetic algorithms and the conventional heuristics. Expand

Minimizing Total Tardiness on One Machine is NP-Hard

- Mathematics, Computer Science
- Math. Oper. Res.
- 1990

The problem of minimizing the total tardiness for a set of independent jobs on one machine is considered and is shown to be NP-hard in the ordinary sense. Expand

A Review of Production Scheduling

- Computer Science
- Oper. Res.
- 1981

The intent of this paper is to present a broad classification for various scheduling problems, to review important theoretical developments for these problem classes, and to contrast the currently available theory with the practice of production scheduling. Expand

On Evolution, Search, Optimization, Genetic Algorithms and Martial Arts : Towards Memetic Algorithms

- Engineering
- 1989

Short abstract, isn't it?

A Review of Production Scheduling, Operations Research

- 1981

A Branch-and-Bound Method for Minimum Tardiness Sequencing on a Single Processor with Sequence Dependent Setup Times

- In Proceedings: Twenty-fourth Annual Meeting of the Decison Sciences
- 1993