Cultural-based genetic tabu algorithm for multiobjective job shop scheduling

DOI10.1155/2014/230719zbMath1407.90184OpenAlexW2074336112WikidataQ59063992 ScholiaQ59063992MaRDI QIDQ1717896

Yuzhen Yang, Xingsheng Gu

Publication date: 8 February 2019

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

Full work available at URL: https://doi.org/10.1155/2014/230719

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Uses Software

• SPEA2

Cites Work

• A simulated annealing based genetic local search algorithm for multi-objective multicast routing problems
• Inventory based bi-objective flow shop scheduling model and its hybrid genetic algorithm
• A multi-objective production scheduling case study solved by simulated annealing
• Incorporating preference information into multi-objective scheduling
• An ant colony optimization algorithm to solve a 2-machine bicriteria flowshop scheduling problem
• A generalized permutation approach to job shop scheduling with genetic algorithms
• Policy iteration based feedback control
• A hybrid genetic algorithm for the job shop scheduling problem
• On the interactive solution to a multicriteria scheduling problem

This page was built for publication: Cultural-based genetic tabu algorithm for multiobjective job shop scheduling