A hybrid genetic algorithm for the single machine maximum lateness problem with release times and family setups

Authors:
Veronique Sels;Mario Vanhoucke
Affiliations:
Faculty of Economics and Business Administration, Ghent University, Tweekerkenstraat 2, 9000 Gent, Belgium;Faculty of Economics and Business Administration, Ghent University, Tweekerkenstraat 2, 9000 Gent, Belgium and Operations and Technology Management Centre, Vlerick Leuven Gent Management School, R ...
Venue:
Computers and Operations Research
Year:
2012

Citing 14
Cited 0

Scheduling in a sequence dependent setup environment with genetic search

Computers and Operations Research - Special issue on genetic algorithms
Single-machine scheduling with release dates, due dates and family setup times

Management Science
The single machine batching problem with family setup times to minimize maximum lateness is strongly NP-hard

Journal of Scheduling
Experimental Testing of Advanced Scatter Search Designs for Global Optimization of Multimodal Functions

Journal of Global Optimization
Single machine batch scheduling problem with family setup times and release dates to minimize makespan

Journal of Scheduling
Theoretical Aspects of Local Search (Monographs in Theoretical Computer Science. An EATCS Series)

Theoretical Aspects of Local Search (Monographs in Theoretical Computer Science. An EATCS Series)
Satisfying due-dates in the presence of sequence dependent family setups with a special comedown structure

Computers and Industrial Engineering
Minimizing total earliness and tardiness on a single machine using a hybrid heuristic

Computers and Operations Research
Fine-Tuning of Algorithms Using Fractional Experimental Designs and Local Search

Operations Research
Heuristics for minimizing maximum lateness on a single machine with family-dependent set-up times

Computers and Operations Research
Genetic algorithms, selection schemes, and the varying effects of noise

Evolutionary Computation
A simulated annealing algorithm for single machine scheduling problems with family setups

Computers and Operations Research
A hybrid dual-population genetic algorithm for the single machine maximum lateness problem

EvoCOP'11 Proceedings of the 11th European conference on Evolutionary computation in combinatorial optimization
Batch scheduling to minimize maximum lateness

Operations Research Letters

Quantified Score

Hi-index	0.01

Visualization

Abstract

We consider the problem of scheduling a number of jobs, each job having a release time, a processing time, a due date and a family setup time, on a single machine with the objective of minimizing the maximum lateness. We develop a hybrid genetic algorithm and validate its performance on a newly developed diverse data set. We perform an extensive study of local search algorithms, based on the trade-off between intensification and diversification strategies, taking the characteristics of the problem into account. We combine different local search neighborhood structures in an intelligent manner to further improve the solution quality. We use the hybrid genetic algorithm to perform a comprehensive analysis of the influence of the different problem parameters on the average maximum lateness value and the performance of the algorithm(s).