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

DOI10.3934/MBE.2019065MaRDI QIDQ2160660zbMATH OpenOpenAlexWikidataFDO

Authors Guo-Hui Zhang, Jinghe Sun, Xing Liu, Yangyang Yang, Guodong 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

active schedulingflexible job shop scheduling problemgenetic algorithmtransportation time

Mathematics Subject Classification ID

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

Cites work

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

Cited in

(3)

• Scheduling flexible job-shops with transportation times: mathematical models and a hybrid imperialist competitive algorithm
• 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

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

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