Results 261 to 270 of about 111,050 (304)

Optimal Scheduling of a Two-stage Hybrid Flow Shop

Mathematical Methods of Operations Research, 2006
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Haouari, Mohamed, Hidri, Lotfi, Gharbi, Anis   +2 more
openaire   +2 more sources

Hybrid flow shop rescheduling for contract manufacturing services

International Journal of Production Research, 2020
Several approaches for strategic and tactical integration of supply chains considering the demand management process have been proposed in the literature.
Iracyanne Retto Uhlmann, Renata Mariani Zanella, Enzo Morosini Frazzon   +2 more
openaire   +1 more source

Hybrid flow shop scheduling considering machine electricity consumption cost

International Journal of Production Economics, 2013
Hybrid flow shop (HFS) scheduling has been extensively examined and the main objective has been to improve production efficiency. However, limited attention has been paid to the consideration of energy consumption with the advent of green manufacturing.
LI, XL, Huang, GQ, Du, B, Luo, H, Chen, HP   +4 more
openaire   +3 more sources

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

Hybrid Flow Shop Scheduling with Batching Requirements

2004
This paper deals with a real-world scheduling problem in the steel industry in which the resources form a hybrid flow shop consisting of 16 production stages. Furthermore, sequence-dependent setup states have to be considered at two production stages leading to a batching problem. The objective is to minimize the weighted tardiness.
Stefan Voß, Andreas Witt
openaire   +1 more source

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 ...
Choong, F., Phon-Amnuaisuk, S., Alias, M. Y.   +2 more
openaire   +2 more sources

An Effective Hybrid Heuristic for Flow Shop Scheduling

The International Journal of Advanced Manufacturing Technology, 2003
In typical production scheduling problems, flow shop scheduling is one of the strongly NP-complete combinatorial optimisation problems with a strong engineering background. In this paper, after investigating the effect of different initialisation, crossover and mutation operators on the performances of a genetic algorithm (GA), we propose an effective ...
D.-Z. Zheng, L. Wang
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

Scheduling Hybrid Flow Shop Containing Multi-Functional Machines

2006 International Conference on Computational Intelligence and Security, 2006
Multi-functional machine (MFM) is often used in the current manufacturing system. In traditional way, the MFM was treated as single-functional machine (SFM), so the functions of the MFM might be wasted. When the multiple functions of an MFM are utilized to process jobs at several stages in a flow shop, the hybrid flow shop scheduling problem under the ...
Yanhai Hu, Dengzhe Ma, Feifan Ye
openaire   +1 more source

Hybrid Genetic Algorithm for Flow Shop Scheduling Problem

2010 International Conference on Intelligent Computation Technology and Automation, 2010
The flow shop scheduling problem (FSSP) is a NP-HARD combinatorial problem with strong industrial background. Among the meta-heuristics, genetic algorithms attracted a lot of attention. However, lacking the major evolution direction, the effectiveness of regular genetic algorithm is restricted.
Jianchao Tang, Guoji Zhang, Binbin Lin, Bixi Zhang   +3 more
openaire   +1 more source