A novel strategy adaptive genetic algorithm with greedy local search for the permutation flowshop scheduling problem

Authors:
Srinjoy Ganguly;Swahum Mukherjee;Debabrota Basu;Swagatam Das
Affiliations:
Dept. of Electronics & Telecommunication Engineering, Jadavpur University, Kolkata, India;Dept. of Electronics & Telecommunication Engineering, Jadavpur University, Kolkata, India;Dept. of Electronics & Telecommunication Engineering, Jadavpur University, Kolkata, India;Electronics and Communication Sciences Unit, Indian Statistical Institute, Kolkata, India
Venue:
SEMCCO'12 Proceedings of the Third international conference on Swarm, Evolutionary, and Memetic Computing
Year:
2012

Citing 8
Cited 0

The shifting bottleneck procedure for job shop scheduling

Management Science
Sequencing in an assembly line with blocking to minimize cycle time

Operations Research
Scheduling computer and manufacturing processes

Scheduling computer and manufacturing processes
Tabu search for a class of single-machine scheduling problems

Computers and Operations Research
Operations Research: An Introduction (8th Edition)

Operations Research: An Introduction (8th Edition)
Principles of Sequencing and Scheduling

Principles of Sequencing and Scheduling
Applying adaptive algorithms to epistatic domains

IJCAI'85 Proceedings of the 9th international joint conference on Artificial intelligence - Volume 1
Ant colony system: a cooperative learning approach to the traveling salesman problem

IEEE Transactions on Evolutionary Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

This article presents a novel Genetic Algorithm with a greedy local search operator that may solve a wide range of sequencing and scheduling discrete optimization problems efficiently. To analyze its performance, we have tested the algorithm on the Permutation Flow-shop Scheduling Problem (PFSSP). Here we present a novel crossover scheme coupled with an innovative mutation scheme that implements local search to facilitate rapid convergence. This novel GA variant provides better results compared to other heuristics, which is apparent from the experimental results and comparisons with other existing algorithms.