Hybrid flexible flowshop problems: models and solution methods
type: Item
instance of: scholarly article
title: Hybrid flexible flowshop problems: models and solution methods
zbMATH Open document ID: 1428.90070
author: Y. Aharonov
published in: Applied Mathematical Modelling
publication date: 2018-12-18T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90C11
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 6994751
zbMATH Keywords: hybrid flowshop scheduling
zbMATH Keywords: mixed integer linear programming model
zbMATH Keywords: hybrid particle swarm optimization algorithms
MaRDI profile type: Publication
full work available at URL: j.apm.2014.04.012
OpenAlex ID: W2004436626
cites work: Scheduling
cites work: The distributed permutation flowshop scheduling problem
cites work: Hybrid flowshop scheduling with machine and resource-dependent processing times
cites work: A study of integer programming formulations for scheduling problems
cites work: A particle swarm optimization algorithm for hybrid flow-shop scheduling with multiprocessor tasks
cites work: Comparative evaluation of MILP flowshop models
cites work: Scheduling open shops with parallel machines to minimize total completion time
cites work: Scheduling flexible flow lines with sequence-dependent setup times
cites work: Algorithms for a realistic variant of flowshop scheduling
cites work: Scheduling jobs on a \(k\)-stage flexible flow-shop
cites work: A review of exact solution methods for the non-preemptive multiprocessor flowshop problem
cites work: Modeling realistic hybrid flexible flowshop scheduling problems
cites work: A discrete version of particle swarm optimization for flowshop scheduling problems
cites work: Two models for a family of flowshop sequencing problems
cites work: A particle swarm optimization algorithm for makespan and total flowtime minimization in the permutation flowshop sequencing problem
cites work: A novel particle swarm optimization algorithm for permutation flow-shop scheduling to minimize makespan
cites work: A genetic algorithm for hybrid flowshops with sequence dependent setup times and machine eligibility
cites work: An immune algorithm approach to hybrid flow shops scheduling with sequence-dependent setup times
cites work: Minimising total tardiness in the \(m\)-machine flowshop problem: A review and evaluation of heuristics and metaheuristics
DOI: 10.1016/J.APM.2014.04.012
description: scientific article; zbMATH DE number 6994751