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

DOI10.1155/2015/184643MaRDI QIDQ1664896zbMATH OpenOpenAlexWikidataFDO

Authors Yuzhen Yang

Publication date 27 August 2018

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

Copyright license Creative Commons Attribution 3.0 Unported

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)

Review text

Summary: The flexible job shop scheduling problem (FJSSP) is a practical extension of classical job shop scheduling problem that is known to be NP-hard. In this paper, an effective modified biogeography-based optimization (MBBO) algorithm with machine-based shifting is proposed to solve FJSSP with makespan minimization. The MBBO attaches great importance to the balance between exploration and exploitation. At the initialization stage, different strategies which correspond to two-vector representation are proposed to generate the initial habitats. At global phase, different migration and mutation operators are properly designed. At local phase, a machine-based shifting decoding strategy and a local search based on insertion to the habitat with best makespan are introduced to enhance the exploitation ability. A series of experiments on two well-known benchmark instances are performed. The comparisons between MBBO and other famous algorithms as well as BBO variants prove the effectiveness and efficiency of MBBO in solving FJSSP.

Recommendations

• Hybrid migrating brids optimization algorithm for the flexible job shop scheduling problem
• Multistage-Based Genetic Algorithm for Flexible Job-Shop Scheduling Problem
• scientific article; zbMATH DE number 6960966
• Distributed assembly permutation flow-shop scheduling problem with sequence-dependent set-up times using a novel biogeography-based optimization algorithm
• A new energy-aware flexible job shop scheduling method using modified biogeography-based optimization

Cites work

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

Cited in

(5)

• A new energy-aware flexible job shop scheduling method using modified biogeography-based optimization
• A new leader guided optimization for the flexible job shop problem
• Hybrid migrating brids optimization algorithm for the flexible job shop scheduling problem
• Distributed assembly permutation flow-shop scheduling problem with sequence-dependent set-up times using a novel biogeography-based optimization algorithm
• A decomposition-based artificial bee colony algorithm for the multi-objective flexible jobshop scheduling problem

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1664896)