Enhanced migrating birds optimization algorithm for the permutation flow shop problem with sequence dependent setup times
type: Item
instance of: scholarly article
title: Enhanced migrating birds optimization algorithm for the permutation flow shop problem with sequence dependent setup times
zbMATH Open document ID: 1380.90129
published in: European Journal of Operational Research
publication date: 2018-02-01T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 6833455
zbMATH Keywords: scheduling
zbMATH Keywords: migrating birds optimization
zbMATH Keywords: permutation flowshop
zbMATH Keywords: makespan
zbMATH Keywords: sequence dependent setup times
author: Aymen Sioud
author: Caroline Gagné
describes a project that uses: Tabu search
MaRDI profile type: Publication
full work available at URL: j.ejor.2017.06.027
OpenAlex ID: W2626429397
cites work: New simple constructive heuristic algorithms for minimizing total flow-time in the permutation flowshop scheduling problem
cites work: The third comprehensive survey on scheduling problems with setup times/costs
cites work: A survey of scheduling problems with setup times or costs
cites work: The significance of reducing setup times/setup costs
cites work: Minimizing the number of tardy jobs in a permutation flowshop scheduling problem with setup times and time lags constraints
cites work: An improved NEH-based heuristic for the permutation flowshop problem
cites work: The two-machine flowshop scheduling problem with sequence-independent setup times: new lower bounding strategies
cites work: Q4354785
cites work: Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
cites work: The two-machine sequence dependent flowshop scheduling problem
cites work: Optimal two- and three-stage production schedules with set-up time included
cites work: Algorithms for a realistic variant of flowshop scheduling
cites work: An improved migrating birds optimisation for a hybrid flowshop scheduling with total flowtime minimisation
cites work: Local search methods for the flowshop scheduling problem with flowtime minimization
cites work: A comprehensive review and evaluation of permutation flowshop heuristics to minimize flowtime
cites work: An integer linear programming approach and a hybrid variable neighborhood search for the car sequencing problem
cites work: A comprehensive review and evaluation of permutation flowshop heuristics
cites work: A genetic algorithm for hybrid flowshops with sequence dependent setup times and machine eligibility
cites work: A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem
cites work: A fuzzy greedy heuristic for permutation flow-shop scheduling
cites work: Flow shop batching and scheduling with sequence-dependent setup times
cites work: Benchmarks for basic scheduling problems
cites work: Q5191184
cites work: General flowshop scheduling problem with the sequence dependent setup times: a heuristic approach
DOI: 10.1016/J.EJOR.2017.06.027
description: scientific article; zbMATH DE number 6833455