In this paper, an effective estimation of distribution algorithm (EDA) is proposed to solve the distributed permutation flow-shop scheduling problem (DPFSP). First, the earliest completion factory rule is employed for the permutation based encoding to generate feasible schedules and calculate the sche...
In this paper, an estimation of distribution algorithm (EDA)-based memetic algorithm (MA) is proposed for solving the distributed assembly permutation flow-shop scheduling problem (DAPFSP) with the objective to minimize the maximum completion time. A novel bi-vector-based method is proposed to ...
With consideration of uncertainty in the distributed manufacturing systems, this paper addresses a multi-objective fuzzy distributed hybrid flow shop scheduling problem with fuzzy processing times and fuzzy due dates. To optimize the fuzzy total tardiness and robustness simultaneously, a cooperative co...
In this article, a memetic discrete differential evolution (MDDE) algorithm is proposed to address the distributed permutation flow shop scheduling problem (DPFSP) with the minimization of the makespan. An enhanced NEH (Nawaz–Enscore–Ham) method is presented to produce potential candidate solutions...
G Yao,S Chheda,I Koren,... - Springer Berlin Heidelberg 被引量: 21发表: 2005年 Bicriteria two-machine flowshop scheduling using metaheuristics A bicriteria two-machine flowshop scheduling problem is addressed to minimize the number of setups and makespan. The jobs have sequence dependent setup...
Distributed no-wait flow-shop scheduling problem (MDNWFSP)estimation of distribution algorithm (EDA)makespanmultiobjectivesequence-dependent setup time (SDST)total weight tardiness (TWT)Influenced by the economic globalization, the distributed manufacturing has been a common production mode. This paper ...
Distribution Algorithm (TDEDA) for distributed no-wait flow-shop scheduling problem (NFSSP) with sequence-independent setup times (SISTs) and release dates (RDs) to minimize the total completion time, which is a typical NP-hard combinatorial optimization problem with strong engineering background. ...
In this study, a multi-objective evolutionary algorithm based on decomposition (MOEA/D) is proposed for energy-efficient scheduling of distributed heterogeneous welding flow shop (DHWFSP). This problem is extended from distributed flow shop with different amounts of machines in different factories. In...
Among all types of distributed scheduling problems, the distributed permutation flowshop scheduling problem (DPFSP) is a generalization of the traditional permutation flowshop scheduling problem (PFSP). In this problem, a set of n jobs have to be processed at a number of f identical factories, ...
As multi-factory production models are more widespread in modern manufacturing systems, a distributed blocking flowshop scheduling problem (DBFSP) is studied in which no buffer between adjacent machines and setup time constraints are considered. To address the above problem, a mixed integer linear pro...