Results 261 to 270 of about 111,684 (303)

Heuristics Resolution of a Constrained Hybrid Flow Shop Problem

11th IEEE Symposium on Computers and Communications (ISCC'06), 2006
Flow shop problems have been extensively studied over the last decade, and numerous works have been published in this area. This paper deals with limited intermediate storage in hybrid flow shop organisation, considering unrelated volumes depending on jobs and including support constraints.
Hamid Hentous, Farid Benhammadi
openaire   +1 more source

Review on Hybrid Flow Shop Scheduling

2011 International Conference of Information Technology, Computer Engineering and Management Sciences, 2011
As a vital decision-making progress, hybrid flow shops (HFS) are common manufacturing environments in which a set of n jobs are to be processed in a series of m stages optimizing a given objective function. Focusing on its complex nature, this paper presents a literature review on HFS scheduling problem, classifies the various type of the problem ...
openaire   +1 more source

Hybrid bat algorithm for flow shop scheduling problems

International Journal of Mathematics in Operational Research, 2016
In this paper, a hybrid bat algorithm is proposed to solve the permutation flow shop scheduling problems with makespan criterion. Developed for numerical optimisation, local search techniques are integrated into the bat algorithm to solve the flow shop problems.
Ömür Tosun, M. K. Marichelvam
openaire   +1 more source

A Hybrid Flow Shop Scheduling Problem

2019
Hybrid flow shop environment generally refers to the flow shop with multiple parallel machines per stage. Hybrid flow shop scheduling problem (HFSP) is a complex combinatorial optimization problem that came across in many real-life problems. In this study, a real-life HFSP of a lubricant company is considered, where the aim is to minimize total ...
Ayşegül Eda Özen, Gülce Çini, Merve Çamlıca, Nilay Çınar, Hasan Bahtiyar Soydan, Levent Kandiller, Hande Öztop   +6 more
openaire   +1 more source

Comparing dispatching rules in dynamic hybrid flow shops

2006 IEEE Conference on Emerging Technologies and Factory Automation, 2006
In this paper, several dispatching rules are studied in hybrid flow shop environment using simulation in order to minimize the mean flow time as well as standard deviation. Hybrid flow shops are productive systems with several stages. Every stage is composed of a pool of machines. This kind of productive configuration has been largely studied in recent
Carlos Andrés, Pedro Gomez, José Pedro García-Sabater   +2 more
openaire   +1 more source

Bounding strategies for the hybrid flow shop scheduling problem

Applied Mathematics and Computation, 2011
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Lotfi Hidri, Mohamed Haouari
openaire   +3 more sources

An efficient hybrid algorithm for a bi-objectives hybrid flow shop scheduling

Intelligent Automation and Soft Computing, 2018
This paper considers the problem of scheduling n independent jobs in g-stage hybrid flow shop environment.
Seyyed Mostafa Mousavi, Mostafa Zandieh
openaire   +1 more source

A hybrid method for scheduling problems of flow shop

Fifth World Congress on Intelligent Control and Automation (IEEE Cat. No.04EX788), 2004
Scheduling is a very complex but important problem. Based on the mathematical model of the scheduling problem, a hybrid algorithm combined the genetic algorithm with the branch and bound method is proposed to solve the flow shop scheduling problems. As for the randomicity and uncertainty of the GA, the feasible space may be broad and the efficiency is ...
null Zhenhao Xu, null Xingsheng Gu
openaire   +1 more source

Flow-shop sequencing using hybrid simulated annealing

Journal of Intelligent Manufacturing, 2004
Simulated annealing (SA) heuristics have been successfully applied on a variety of complex optimization problems. This paper presents a new hybrid SA approach for the permutation flow-shop scheduling (FSS) problem. FSS is known to be NP-hard, and thus the right way to proceed is through the use of heuristics techniques.
openaire   +1 more source

A Hybrid Genetic Algorithm for the Flow-Shop Scheduling Problem

2006
The flow-shop scheduling problem with the makespan criterion is an important production scheduling problem. Although this problem has a simple formulation, it is NP-hard. Therefore many heuristic and metaheuristic methods had been proposed to solve this problem. In this paper, a hybrid genetic algorithm is presented for the flow-shop scheduling problem.
Lin Yu Tseng 0001, Ya-Tai Lin
openaire   +1 more source