Hybrid genetic algorithm with multiparents crossover for job shop scheduling problems
type: Item
instance of: scholarly article
title: Hybrid genetic algorithm with multiparents crossover for job shop scheduling problems
zbMATH Open document ID: 1394.90295
DOI: 10.1155/2015/210680
author: Noor Hasnah Moin
author: Ong Chung Sin
author: Mohd Omar
published in: Mathematical Problems in Engineering
publication date: 2018-08-27T00:00:00Z
review text: Summary: The job shop scheduling problem (JSSP) is one of the well-known hard combinatorial scheduling problems. This paper proposes a hybrid genetic algorithm with multiparents crossover for JSSP. The multiparents crossover operator known as extended precedence preservative crossover (EPPX) is able to recombine more than two parents to generate a single new offspring distinguished from common crossover operators that recombine only two parents. This algorithm also embeds a schedule generation procedure to generate full-active schedule that satisfies precedence constraints in order to reduce the search space. Once a schedule is obtained, a neighborhood search is applied to exploit the search space for better solutions and to enhance the GA. This hybrid genetic algorithm is simulated on a set of benchmarks from the literatures and the results are compared with other approaches to ensure the sustainability of this algorithm in solving JSSP. The results suggest that the implementation of multiparents crossover produces competitive results.
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 6925777
describes a project that uses: JOBSHOP
MaRDI profile type: Publication
full work available at URL: https://doi.org/10.1155/2015/210680
OpenAlex ID: W2052954229
Wikidata QID: Q59117621
cites work: Q3523239
cites work: A tabu search algorithm with a new neighborhood structure for the job shop scheduling problem
cites work: Q4730766
cites work: A hybrid genetic algorithm for the job shop scheduling problem
cites work: A Fast Taboo Search Algorithm for the Job Shop Problem
cites work: A new hybrid genetic algorithm for job shop scheduling problem
cites work: Q4350085
cites work: Q4370809
cites work: A multicriteria heuristic method to improve resource allocation in multiproject scheduling
cites work: A Computational Study of the Job-Shop Scheduling Problem
cites work: The Shifting Bottleneck Procedure for Job Shop Scheduling
cites work: A grasp for job shop scheduling
Recommended article: A hybrid genetic algorithm for the job shop scheduling problem
Recommended article: A new hybrid genetic algorithm for job shop scheduling problem
Recommended article: A multi-crossover genetic algorithm and its application in JOB SHOP scheduling system
Recommended article: A hybrid genetic algorithm for stochastic job-shop scheduling problems
Recommended article: A new hybrid parallel genetic algorithm for the job‐shop scheduling problem
Recommended article: A hybrid evolutionary algorithm for the job shop scheduling problem
Recommended article: A hybrid evolutionary algorithm to solve the job shop scheduling problem
Recommended article: A genetic algorithm for hybrid flow-shop scheduling with multiprocessor tasks
description: scientific article; zbMATH DE number 6925777