Effective metaheuristics for scheduling a hybrid flowshop with sequence-dependent setup times
type: Item
instance of: scholarly article
title: Effective metaheuristics for scheduling a hybrid flowshop with sequence-dependent setup times
zbMATH Open document ID: 1411.90154
author: Liang Gao
author: Xinyu Li
author: Kai-Zhou Gao
author: Quanke Pan
published in: Applied Mathematics and Computation
publication date: 2019-03-28T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 7044134
zbMATH Keywords: scheduling
zbMATH Keywords: flowshop
zbMATH Keywords: iterated local search
zbMATH Keywords: fruit fly optimization
zbMATH Keywords: migrating birds optimization
zbMATH Keywords: artificial bee colony
describes a project that uses: Tabu search
MaRDI profile type: Publication
full work available at URL: j.amc.2017.01.004
OpenAlex ID: W2581299131
cites work: Q3525911
cites work: Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
cites work: Les problèmes d'ordonnancement de type flow-shop hybride : état de l'art
cites work: Two-Stage, Hybrid Flowshop Scheduling Problem
cites work: Scheduling flexible flow lines with sequence-dependent setup times
cites work: An immune algorithm approach to hybrid flow shops scheduling with sequence-dependent setup times
cites work: A genetic algorithm for hybrid flowshops with sequence dependent setup times and machine eligibility
cites work: Algorithms for a realistic variant of flowshop scheduling
cites work: Modeling realistic hybrid flexible flowshop scheduling problems
cites work: Hybrid flow shop scheduling with sequence dependent family setup time and uncertain due dates
cites work: Review and classification of hybrid flow shop scheduling problems from a production system and a solutions procedure perspective
cites work: The hybrid flow shop scheduling problem
cites work: Q4452900
cites work: A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem
cites work: An iterated greedy heuristic for the sequence dependent setup times flowshop problem with makespan and weighted tardiness objectives
cites work: A multi-restart iterated local search algorithm for the permutation flow shop problem minimizing total flow time
cites work: Local search methods for the flowshop scheduling problem with flowtime minimization
cites work: A variable iterated greedy algorithm with differential evolution for the no-idle permutation flowshop scheduling problem
cites work: Iterated local search based on multi-type perturbation for single-machine earliness/tardiness scheduling
cites work: An effective co-evolutionary artificial bee colony algorithm for steelmaking-continuous casting scheduling
cites work: Variable neighborhood search: Principles and applications
cites work: A particle swarm optimization algorithm for makespan and total flowtime minimization in the permutation flowshop sequencing problem
cites work: The distributed permutation flowshop scheduling problem
cites work: Q4354785
cites work: A tabu search/path relinking algorithm to solve the job shop scheduling problem
cites work: An estimation of distribution algorithm for minimizing the total flowtime in permutation flowshop scheduling problems
cites work: A variable iterated greedy algorithm for the traveling salesman problem with time windows
cites work: Benchmarks for basic scheduling problems
cites work: Q5472387
cites work: Local optimization of dynamic programs with guaranteed satisfaction of path constraints
cites work: Metaheuristics—the metaphor exposed
cites work: Iterated search methods for earliness and tardiness minimization in hybrid flowshops with due windows
DOI: 10.1016/J.AMC.2017.01.004
description: scientific article; zbMATH DE number 7044134