A hybrid metaheuristic approach for minimizing the total flow time in a flow shop sequence dependent group scheduling problem

DOI10.3390/A7030376zbMATH Open1461.90042OpenAlexW2123087625MaRDI QIDQ1736622FDOQ1736622

Xianqiang Yang

Publication date: 26 March 2019

Published in: Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3390/a7030376

zbMATH Keywords

genetic algorithmsequencingdecodingencodingcellular manufacturing

Mathematics Subject Classification ID

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

Cites Work

• Design and Analysis of Experiments, Second Edition
• Scheduling
• Title not available (Why is that?)
• Principles of Sequencing and Scheduling
• Scheduling a flowline manufacturing cell with sequence dependent family setup times
• Total flow time minimization in a flowshop sequence-dependent group scheduling problem
• Integrated cellular manufacturing systems design with production planning and dynamic system reconfiguration
• Some design issues in cellular manufacturing using the fuzzy programming approach
• Two-machine group scheduling problems in discrete parts manufacturing with sequence-dependent setups
• Two-machine group scheduling problem with blocking and anticipatory setups
• An ant colony optimization metaheuristic for machine-part cell formation problems

Cited In (3)

• Genetic algorithms in supply chain management: a critical analysis of the literature
• The third comprehensive survey on scheduling problems with setup times/costs
• A comprehensive review of flowshop group scheduling literature

Uses Software

• Genocop

   Recommendations

• Total flow time minimization in a flowshop sequence-dependent group scheduling problem 👍 👎
• Effective metaheuristics for scheduling a hybrid flowshop with sequence-dependent setup times 👍 👎
• Solving the flowshop scheduling problem with sequence dependent setup times using advanced metaheuristics 👍 👎
• Minimizing total completion time in the flexible flowshop sequence-dependent group scheduling problem 👍 👎
• Development of a hybrid metaheuristic to minimise earliness and tardiness in a hybrid flowshop with sequence-dependent setup times 👍 👎
• A robust meta-hyper-heuristic approach to hybrid flow-shop scheduling 👍 👎
• Metaheuristic algorithms for the hybrid flowshop scheduling problem 👍 👎
• Minimizing makespan in permutation flow shop scheduling problems using a hybrid metaheuristic algorithm 👍 👎

This page was built for publication: A hybrid metaheuristic approach for minimizing the total flow time in a flow shop sequence dependent group scheduling problem

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