A modified biogeography-based optimization for the flexible job shop scheduling problem

DOI10.1155/2015/184643zbMath1394.90313OpenAlexW1895197542WikidataQ59117522 ScholiaQ59117522MaRDI QIDQ1664896

Yuzhen Yang

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/184643

Mathematics Subject Classification ID

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

Cites Work

• An effective architecture for learning and evolving flexible job-shop schedules
• Job-shop scheduling with multi-purpose machines
• Effective neighbourhood functions for the flexible job shop problem
• Routing and scheduling in a flexible job shop by tabu search
• A hybrid genetic and variable neighborhood descent algorithm for flexible job shop scheduling problems
• A genetic algorithm for the flexible job-shop scheduling problem
• A variable neighbourhood search algorithm for the flexible job-shop scheduling problem

This page was built for publication: A modified biogeography-based optimization for the flexible job shop scheduling problem