A comparison of scheduling algorithms for flexible flow shop problems with unrelated parallel machines, setup times, and dual criteria
type: Item
instance of: scholarly article
title: A comparison of scheduling algorithms for flexible flow shop problems with unrelated parallel machines, setup times, and dual criteria
zbMATH Open document ID: 1157.90417
author: Jitti Jungwattanakit
author: Manop Reodecha
author: Paveena Chaovalitwongse
author: Frank Werner
published in: Computers \& Operations Research
publication date: 2008-11-07T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C59
Mathematics Subject Classification ID: 68T05
Mathematics Subject Classification ID: 68W10
zbMATH DE Number: 5363304
zbMATH Keywords: flexible flow shop
zbMATH Keywords: constructive algorithms
zbMATH Keywords: simulated annealing
zbMATH Keywords: tabu search
zbMATH Keywords: genetic algorithms
MaRDI profile type: Publication
full work available at URL: j.cor.2007.10.004
OpenAlex ID: W2086672027
Wikidata QID: Q57633880
cites work: Scheduling of flexible flow lines in an automobile assembly plant
cites work: Heuristics for hybrid flow shops with controllable processing times and assignable due dates
cites work: Q4051864
cites work: Branch and bound algorithm for the flow shop with multiple processors
cites work: Two-Stage, Hybrid Flowshop Scheduling Problem
cites work: Scheduling algorithms for flexible flowshops: Worst and average case performance
cites work: A computational study of heuristics for two-stage flexible flowshops
cites work: Scheduling a two-stage hybrid flowshop with separable setup and removal times
cites work: The flow shop with parallel machines: A tabu search approach
cites work: A genetic algorithm for flowshop sequencing
cites work: Solving the flowshop scheduling problem with sequence dependent setup times using advanced metaheuristics
cites work: A survey of scheduling problems with setup times or costs
cites work: Q5485395
cites work: A Heuristic Algorithm for the n Job, m Machine Sequencing Problem
cites work: A Functional Heuristic Algorithm for the Flowshop Scheduling Problem
cites work: An Evaluation of Flow Shop Sequencing Heuristics
cites work: Optimization by Simulated Annealing
cites work: Convergence of an annealing algorithm
cites work: Future paths for integer programming and links to artificial intelligence
cites work: Q4079017
cites work: Scheduling to minimize the sum of weighted flowtime and weighted tardiness of jobs in a flowshop with sequence-dependent setup times.
DOI: 10.1016/J.COR.2007.10.004
description: scientific article; zbMATH DE number 5363304