Results 261 to 270 of about 4,751,531 (301)

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   +2 more sources

Metaheuristic methods in hybrid flow shop scheduling problem

Expert Systems with Applications, 2011
Memetic algorithms are hybrid evolutionary algorithms that combine global and local search by using an evolutionary algorithm to perform exploration while the local search method performs exploitation. This paper presents two hybrid heuristic algorithms that combine particle swarm optimization (PSO) with simulated annealing (SA) and tabu search (TS ...
Florence Chiao Choong Mei, Somnuk Phon-Amnuaisuk, Mohammad Yusoff Alias   +2 more
openaire   +3 more sources

Heterogeneous Distributed Flow Shop Scheduling and Reentrant Hybrid Flow Shop Scheduling in Seamless Steel Tube Manufacturing

2021
In the actual manufacturing process of seamless steel tubes, the scheduling of ordinary production workshops and cold drawing workshops is a problem with NP-hard characteristics. Aiming at ordinary production workshops and cold drawing workshops, distributed flow shop scheduling models and reentrant scheduling models are established.
Xiuli Wu, Zirun Xie
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   +4 more sources

A Genetic Algorithm for Hybrid Flow-shop Scheduling with Multiprocessor Tasks

Journal of Scheduling, 2005
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ceyda Oguz, Muhammet Fikret Ercan
openaire   +4 more sources

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 flow shop scheduling with parallel batching

International Journal of Production Economics, 2009
Abstract In this research the problem of parallel batch scheduling in a hybrid flow shop environment with minimizing Cmax is studied. In parallel batching it is assumed that machines in some stages are able to process a number of operations simultaneously.
Mohammad Reza Amin-Naseri, Mohammad Ali Beheshti-Nia   +1 more
openaire   +1 more source

A production scheduling system in a hybrid flow shop

International Journal of Production Economics, 1995
Abstract This paper deals with a production scheduling problem in the two-stage hybrid flow shop, when there is one machine at the first stage and the second stage consists of different kinds of machine. First, the total flowtime or makespan and the maximum work-in-process are formulated as criteria for manufacturing performance.
Toshifumi Uetake, Hitoshi Tsubone, Masaaki Ohba   +2 more
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

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   +2 more sources