Results 251 to 260 of about 10,154 (312)

Hybrid Flow Shop with Setup Times Scheduling Problem

Computer Systems Science and Engineering, 2023
Mahdi Jemmali, Lotfi Hidri
openaire   +1 more source

Scheduling hybrid flow shop problem with non-fixed availability constraints

European J. of Industrial Engineering, 2010
In this study, we deal with a k-stage hybrid flow shop scheduling problem under availability constraints (HFSPAC). In such a problem, machines are not continuously available due to preventive maintenance tasks. Our study aims to provide a good approximate solution to this specific problem with the makespan minimisation as the performance measure.
Walid Besbes, Jacques Teghem, Taicir Loukil   +2 more
openaire   +1 more source

Mixed integer programming formulation for hybrid flow shop scheduling problem

2010 IEEE International Conference on Industrial Engineering and Engineering Management, 2010
This paper addresses a complex hybrid flow shop (HFS) scheduling problem confronted in a real industrial environment in which a manufacturing firm provides electroplating service to the electronic and semiconductor industries. A mixed integer programming (MIP) formulation was developed to represent the scheduling problem.
Mohamed K. Omar, Teo S. C., Yasothei Suppiah   +2 more
openaire   +1 more source

Considering bills of material in hybrid flow shop scheduling problems

Proceedings of the 1997 IEEE International Symposium on Assembly and Task Planning (ISATP'97) - Towards Flexible and Agile Assembly and Manufacturing -, 2002
In this paper, we propose to take bills of material into account in hybrid flow shop scheduling problems. We study the scheduling of N jobs in a hybrid flow shop with V-stages and identical parallel machines. We also consider that the jobs are subject to precedence constraints.
openaire   +1 more source

Immune clonal selection algorithm for hybrid flow-shop scheduling problem

2009 Chinese Control and Decision Conference, 2009
In this paper, the mixed-integer nonlinear programming model is established for hybrid flow-shop scheduling problem (HFSP) with the minimum of makespan as the objective function. In order to reduce the computational complexity, immune clonal selection algorithm (ICSA) is applied to HFSP.
null Feng Liu, null Xiang-ping Zhang, null Feng-xing Zou, null Ling-li Zeng   +3 more
openaire   +1 more source

Scheduling a Hybrid Flow-Shop Problem via Artificial Immune System

2013
This paper investigates a two-stage hybrid flowshop problem with a single batch processing machine in the first stage and a single machine in the second stage. In the problem, each job has an individual release time and the jobs are grouped into several batches.
Tsui-Ping Chung, Ching-Jong Liao
openaire   +1 more source

A distributed approach to solving hybrid flow-shop scheduling problem

2009 Chinese Control and Decision Conference, 2009
In this paper, a mathematical programming model is established for hybrid flow-shop scheduling problem, with the minimum of the makespan as the objective function. Based on the particle swarm optimization algorithm, a distributed approach according to the process is presented to solve the global problem.
null Zou Feng-xing, null Zeng Ling-li, null Gao Zheng, null Liu Feng   +3 more
openaire   +1 more source

A multiobjective memetic algorithm with particle swarm optimization and Q-learning-based local search for energy-efficient distributed heterogeneous hybrid flow-shop scheduling problem

Expert systems with applications, 2023
Wenqiang Zhang, Chen Li, Mitsuo Gen, Weidong Yang, Guohui Zhang   +4 more
semanticscholar   +1 more source

Solving energy-efficient fuzzy hybrid flow-shop scheduling problem at a variable machine speed using an extended NSGA-II

Engineering applications of artificial intelligence, 2023
Yi-Jian Wang, Gaige Wang, Fangxiao Tian, D. Gong, W. Pedrycz   +4 more
semanticscholar   +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, Ya-Tai Lin
openaire   +1 more source