Hybrid genetic algorithm with multiparents crossover for job shop scheduling problems

DOI10.1155/2015/210680zbMath1394.90295OpenAlexW2052954229WikidataQ59117621 ScholiaQ59117621MaRDI QIDQ1665003

Noor Hasnah Moin, Mohd Omar, Ong Chung Sin

Publication date: 27 August 2018

Published in: Mathematical Problems in Engineering (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1155/2015/210680

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Uses Software

• JOBSHOP

Cites Work

• A tabu search algorithm with a new neighborhood structure for the job shop scheduling problem
• A multicriteria heuristic method to improve resource allocation in multiproject scheduling
• A new hybrid genetic algorithm for job shop scheduling problem
• A hybrid genetic algorithm for the job shop scheduling problem
• The Shifting Bottleneck Procedure for Job Shop Scheduling
• A Computational Study of the Job-Shop Scheduling Problem
• A Fast Taboo Search Algorithm for the Job Shop Problem
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Hybrid genetic algorithm with multiparents crossover for job shop scheduling problems