Solving flexible job shop scheduling problems with transportation time based on improved genetic algorithm

DOI10.3934/mbe.2019065zbMath1497.90103OpenAlexW2918095264WikidataQ92853295 ScholiaQ92853295MaRDI QIDQ2160660

Yangyang Yang, Guo-Hui Zhang, Xing Liu, Jinghe Sun, Guo-Dong Wang

Publication date: 3 August 2022

Published in: Mathematical Biosciences and Engineering (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3934/mbe.2019065

zbMATH Keywords

genetic algorithmtransportation timeflexible job shop scheduling problemactive scheduling

Mathematics Subject Classification ID

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

Related Items (2)

A hybrid many-objective evolutionary algorithm for flexible job-shop scheduling problem with transportation and setup times ⋮ A novel heuristic method for the energy-efficient flexible job-shop scheduling problem with sequence-dependent set-up and transportation time

Cites Work

• Tabu search algorithms for job-shop problems with a single transport robot
• Preemptive scheduling in the presence of transportation times
• A hybrid particle swarm optimisation for multi-objective flexible job-shop scheduling problem with dual-resources constrained

This page was built for publication: Solving flexible job shop scheduling problems with transportation time based on improved genetic algorithm