Multiobjective Scheduling by Genetic Algorithms
Multiobjective Scheduling by Genetic Algorithms describes methods for developing multiobjective solutions to common production scheduling equations modeling in the literature as flowshops, job shops and open shops. The methodology is metaheuristic, one inspired by how nature has evolved a multitude of coexisting species of living beings on earth.
Multiobjective flowshops, job shops and open shops are each highly relevant models in manufacturing, classroom scheduling or automotive assembly, yet for want of sound methods they have remained almost untouched to date. This text shows how methods such as Elitist Nondominated Sorting Genetic Algorithm (ENGA) can find a bevy of Pareto optimal solutions for them. Also it accents the value of hybridizing Gas with both solution-generating and solution-improvement methods. It envisions fundamental research into such methods, greatly strengthening the growing reach of metaheuristic methods.
This book is therefore intended for students of industrial engineering, operations research, operations management and computer science, as well as practitioners. It may also assist in the development of efficient shop management software tools for schedulers and production planners who face multiple planning and operating objectives as a matter of course.
What people are saying - Write a review
We haven't found any reviews in the usual places.
What are Genetic Algorithms?
Calibration of GA Parameters
Job Shop Scheduling
Multiobjective Flowshop Scheduling
A New Genetic Algorithm for Sequencing
A Comparison of Multiobjective Flowshop
Other editions - View all
adaptation alleles applied cell Chapter chrom chromosome Cmax computational constraints convergence cout cprintf cputs crossover and mutation Darwin Darwinian delete due dates dummy fitness efficient elite evaluate factors Figure FINDING PARETO OPTIMAL fitness landscape float flowshop problem flowshop scheduling genes genetic algorithms global Goldberg goto gotoxy heuristic heuristic methods hybrid improve individuals initial population int NJOBS itoa job sequence Lamarckian machine makespan mating pool mean flow meiosis meta-heuristic minimization multiobjective flowshop multiobjective optimization multiobjective problem multiple natural selection niche formation NP-hard NSGA and ENGA objective function offspring operations optimization problems optimum organisms parameterization parameters parent Pareto optimal solutions Pareto solutions partial schedule performance phenotype procedure produce progeny protein random random seeds randomly recombination representation reproduction robust design scheduling problem scheme Seed simulated annealing solve speciation species Step string substrings system cls Table tabu search textxy void