However, no previous studies on reentrant flow shop scheduling have considered the impact of limited buffer capacity or stockers on scheduling efficiency. Consequently, this study investigated the application of stockers in solving the reentrant hybrid flow shop scheduling problem with limited buffer ...
Bi-objectivePareto dominanceIn this paper, a Pareto-based discrete harmony search (P-DHS) algorithm is proposed to solve the reentrant hybrid flowshop scheduling problem (RHFSP) with the makespan and the total tardiness criteria. For each job, the operation set of each pass is regarded as a ...
we focus on the scheduling problem, called the reentrant hybrid flow shop scheduling problem in this paper. Also, as one of the practical reasons, we consider system throughput as well as satisfying due dates with a certain allowance at
solve the single-machine scheduling problem and the flow shop scheduling problem. This paper will use the ensemble model to solve the RHFS scheduling problem and hybrid it with the DE to improve the performance of the proposed DE. Neural Comput & Applic 123 Considering the difficulty of inspecti...
Reentranthybridflowshops . Scheduling .Branchandbound . Heuristics1 IntroductionA hybrid flow shop, which is an extended system of theordinary flow shop, consists of two or more productionstages in series and there exist one or more parallelmachines at each stage. The parallel machines are added...
可重入混合流水车间调度允许一个工件多次进入某些加工阶段, 它广泛出现在许多工业制造过程中, 如半 导体制造、印刷电路板制造等. 本文研究了带运输时间的多阶段动态可重入混合流水车间问题, 目标是最小化总加 权完成时间. 针对该问题, 建立了整数规划模型, 进而基于工件解耦
(2011) Bi-objective scheduling for reentrant hybrid flow shop using Pareto genetic algorithm. Computers & Industrial Engineering, v. 61, p. 529-541.Hang-Min Cho,Suk-JooB ae,JungwukK im,In-Jae Jeong.Bi-objective scheduling for reentrant hybrid flow shop using Pareto genetic algorithm[J]....
which is a hybrid flow shop with reentrance. The purpose is to minimize the total weighted number of tardy jobs. A genetic algorithm is developed in order to deal with large size problems. Chakhlevitch and Glass [25] proposed a special two-stage hybrid reentrant flow shop scheduling problem...
A hybrid genetic algorithm for the re-entrant flow-shop scheduling problem 2008, Expert Systems with Applications Show abstract A distributed shifting bottleneck heuristic for complex job shops 2005, Computers and Industrial Engineering Citation Excerpt : The upper layer is formed by a fluid model opti...
Y. (2014). Bi-objective reentrant hybrid flowshop scheduling: An iterated Pareto greedy algorithm. International Journal of Production Research , 52 (19), 5735–5747.Ying K C,Lin S W,Wan S Y. Bi-objective r.eentrant hybrid flowshop scheduling:an iterated Pareto greedy algorithm[J]....