Hybrid flexible flowshop problems: models and solution methods
From MaRDI portal
Publication:1634549
DOI10.1016/j.apm.2014.04.012zbMath1428.90070OpenAlexW2004436626MaRDI QIDQ1634549
Publication date: 18 December 2018
Published in: Applied Mathematical Modelling (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.apm.2014.04.012
hybrid flowshop schedulinghybrid particle swarm optimization algorithmsmixed integer linear programming model
Mixed integer programming (90C11) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (4)
A bi-objective flexible flow shop scheduling problem with machine-dependent processing stages: trade-off between production costs and energy consumption ⋮ Shop scheduling in manufacturing environments: a review ⋮ A review and classification on distributed permutation flowshop scheduling problems ⋮ Efficiency of the solution representations for the hybrid flow shop scheduling problem with makespan objective
Cites Work
- Hybrid flowshop scheduling with machine and resource-dependent processing times
- Scheduling open shops with parallel machines to minimize total completion time
- Algorithms for a realistic variant of flowshop scheduling
- An immune algorithm approach to hybrid flow shops scheduling with sequence-dependent setup times
- A particle swarm optimization algorithm for makespan and total flowtime minimization in the permutation flowshop sequencing problem
- A discrete version of particle swarm optimization for flowshop scheduling problems
- Modeling realistic hybrid flexible flowshop scheduling problems
- Minimising total tardiness in the \(m\)-machine flowshop problem: A review and evaluation of heuristics and metaheuristics
- The distributed permutation flowshop scheduling problem
- A review of exact solution methods for the non-preemptive multiprocessor flowshop problem
- Two models for a family of flowshop sequencing problems
- Scheduling flexible flow lines with sequence-dependent setup times
- Scheduling jobs on a \(k\)-stage flexible flow-shop
- A novel particle swarm optimization algorithm for permutation flow-shop scheduling to minimize makespan
- A genetic algorithm for hybrid flowshops with sequence dependent setup times and machine eligibility
- A study of integer programming formulations for scheduling problems
- A particle swarm optimization algorithm for hybrid flow-shop scheduling with multiprocessor tasks
- Comparative evaluation of MILP flowshop models
- Scheduling
This page was built for publication: Hybrid flexible flowshop problems: models and solution methods
