Solving the flowshop scheduling problem with sequence dependent setup times using advanced metaheuristics
type: Item
instance of: scholarly article
title: Solving the flowshop scheduling problem with sequence dependent setup times using advanced metaheuristics
zbMATH Open document ID: 1112.90338
author: Rubén Ruiz
author: Concepción Maroto
author: Javier Alcaraz
published in: European Journal of Operational Research
publication date: 2005-05-12T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 2167872
zbMATH Keywords: scheduling
zbMATH Keywords: genetic algorithms
zbMATH Keywords: sequence dependent setup times
zbMATH Keywords: local search
describes a project that uses: Genocop
MaRDI profile type: Publication
full work available at URL: j.ejor.2004.01.022
OpenAlex ID: W2068003474
cites work: A robust genetic algorithm for resource allocation in project scheduling
cites work: Solving the Multi-Mode Resource-Constrained Project Scheduling Problem with genetic algorithms
cites work: New heuristics for no-wait flowshops to minimize makespan.
cites work: A Heuristic Algorithm for the n Job, m Machine Sequencing Problem
cites work: Q4658190
cites work: Two machine flow shop scheduling problems with sequence dependent setup times: A dynamic programming approach
cites work: A Savings Index Heuristic Algorithm for Flowshop Scheduling with Sequence Dependent Set-up Times
cites work: The Complexity of Flowshop and Jobshop Scheduling
cites work: Q4692508
cites work: Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
cites work: FLOWSHOP SCHEDULES WITH SEQUENCE DEPENDENT SETUP TIMES
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: Q4873721
cites work: Q3525911
cites work: A genetic algorithm for flowshop sequencing
cites work: Computational experience with a branch-and-cut algorithm for flowshop scheduling with setups.
cites work: Heuristics for the flow line problem with setup costs
cites work: An enhanced TSP-based heuristic for makespan minimization in a flow shop with setup times
cites work: A comprehensive review and evaluation of permutation flowshop heuristics
cites work: A MILP model for then-job,M-stage flowshop with sequence dependent set-up times
cites work: Q3806968
cites work: Some efficient heuristic methods for the flow shop sequencing problem
cites work: Benchmarks for basic scheduling problems
cites work: Two MILP models for the N × M SDST flowshop sequencing problem
cites work: A new heuristic method for the flow shop sequencing problem
cites work: Survey of scheduling research involving setup times
DOI: 10.1016/J.EJOR.2004.01.022
description: scientific article; zbMATH DE number 2167872