Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

11

EOR
2010

favoriteEmaildiscussreport

96views more EOR 2010»

The hybrid flow shop scheduling problem

13 years 4 months ago

The hybrid flow shop scheduling problem

Download www.upv.es

The scheduling of flow shops with multiple parallel machines per stage, usually referred to as the Hybrid Flow Shop (HFS), is a complex combinatorial problem encountered in many real world applications. Given its importance and complexity, the HFS problem has been intensively studied. This paper presents a literature review on exact, heuristic and metaheuristic methods that have been proposed for its solution. The paper discusses several variants of the HFS problem, each in turn considering different assumptions, constraints and objective functions. Research opportunities in HFS are also discussed.

Rubén Ruiz, José Antonio Vázq

Real-time Traffic

Complex Combinatorial Problem | EOR 2010 | Flow Shop | HFS Problem |

claim paper

Related Content

» An estimation of distribution algorithm with guided mutation for a complex flow shop sched...

» Proportionate flexible flow shop scheduling via a hybrid constructive genetic algorithm

» Evolutionary Clustering Search for Flowtime Minimization in Permutation Flow Shop

» A Randomized Algorithm for Flow Shop Scheduling

» Investigating Parallel Genetic Algorithms on Job Shop Scheduling Problems

» JobShop Scheduling with an Adaptive Neural Network and Local Search Hybrid Approach

» A New Hybrid Genetic Algorithm for the Job Shop Scheduling Problem with Setup Times

» A Hybrid Constraint Programming Local Search Approach to the JobShop Scheduling Problem

» A hybrid method for solving stochastic job shop scheduling problems

Post Info
More Details (n/a)

Added	10 Dec 2010
Updated	10 Dec 2010
Type	Journal
Year	2010
Where	EOR
Authors	Rubén Ruiz, José Antonio Vázquez Rodríguez

Comments (0)