A hybrid permutation-coded evolutionary algorithm for the early/tardy scheduling problem

dc.contributor.author	Singh, Alok
dc.date.accessioned	2022-03-27T06:03:48Z
dc.date.available	2022-03-27T06:03:48Z
dc.date.issued	2010-12-01
dc.description.abstract	In this paper, we have proposed a hybrid permutation-coded steady-state genetic algorithm for a single machine scheduling problem with earliness and tardiness costs and no machine idle time. The steady-state genetic algorithm generates schedules, which are further improved by successive applications of an adjacent pairwise interchange procedure. We have compared our approach against the best approaches reported in the literature. Computational results show the effectiveness of our approach, since it obtained better quality solutions in shorter time. © 2010 World Scientific Publishing Co. & Operational Research Society of Singapore.
dc.identifier.citation	Asia-Pacific Journal of Operational Research. v.27(6)
dc.identifier.issn	02175959
dc.identifier.uri	10.1142/S021759591000296X
dc.identifier.uri	https://www.worldscientific.com/doi/abs/10.1142/S021759591000296X
dc.identifier.uri	https://dspace.uohyd.ac.in/handle/1/9237
dc.subject	early/tardy
dc.subject	heuristics
dc.subject	Scheduling
dc.subject	single machine
dc.subject	steady-state genetic algorithms
dc.subject	uniform order-based crossover
dc.title	A hybrid permutation-coded evolutionary algorithm for the early/tardy scheduling problem
dc.type	Journal. Article
dspace.entity.type

Now showing 1 - 1 of 1