An efficient hybrid algorithm based on modified imperialist competitive algorithm and K-means for data clustering
Clustering techniques have received attention in many fields of study such as engineering,
medicine, biology and data mining. The aim of clustering is to collect data points. The K …
medicine, biology and data mining. The aim of clustering is to collect data points. The K …
A novel imperialist competitive algorithm for bi-criteria scheduling of the assembly flowshop problem
E Shokrollahpour, M Zandieh… - International Journal of …, 2011 - Taylor & Francis
This paper deals with the two-stage assembly flowshop scheduling problem with
minimisation of weighted sum of makespan and mean completion time as the objective. The …
minimisation of weighted sum of makespan and mean completion time as the objective. The …
Modified imperialist competitive algorithm based on attraction and repulsion concepts for reliability-redundancy optimization
LD Afonso, VC Mariani, L dos Santos Coelho - Expert Systems with …, 2013 - Elsevier
System reliability analysis and optimization are important to efficiently utilize available
resources and to develop an optimal system design architecture. System reliability …
resources and to develop an optimal system design architecture. System reliability …
A discrete colonial competitive algorithm for hybrid flowshop scheduling to minimize earliness and quadratic tardiness penalties
J Behnamian, M Zandieh - Expert Systems with Applications, 2011 - Elsevier
Recently introduced colonial competitive algorithm (CCA) has shown its excellent capability
on different optimization problems. The aim of this paper is to propose a discrete version of …
on different optimization problems. The aim of this paper is to propose a discrete version of …
An efficient imperialist competitive algorithm for scheduling in the two-stage assembly flow shop problem
H Seidgar, M Kiani, M Abedi… - International Journal of …, 2014 - Taylor & Francis
This paper considers a two-stage assembly flow shop problem where m parallel machines
are in the first stage and an assembly machine is in the second stage. The objective is to …
are in the first stage and an assembly machine is in the second stage. The objective is to …
Optimization of process planning with various flexibilities using an imperialist competitive algorithm
K Lian, C Zhang, X Shao, L Gao - The International Journal of Advanced …, 2012 - Springer
In this paper, we investigate the optimization of process planning in which various
flexibilities are considered. The objective is to minimize total weighted sum of manufacturing …
flexibilities are considered. The objective is to minimize total weighted sum of manufacturing …
Bi-objective optimisation for scheduling the identical parallel batch-processing machines with arbitrary job sizes, unequal job release times and capacity limits
M Abedi, H Seidgar, H Fazlollahtabar… - International Journal of …, 2015 - Taylor & Francis
This paper deals the scheduling identical parallel batch-processing machines (BPMs) that
each machine can be process a group of jobs as a batch simultaneously. The paper …
each machine can be process a group of jobs as a batch simultaneously. The paper …
Bi-objective optimization for integrating production and preventive maintenance scheduling in two-stage assembly flow shop problem
This paper presents a new bi-objective mixed integer programming model for the two-stage
assembly flow shop scheduling problem with preventive maintenance (PM) activities, in …
assembly flow shop scheduling problem with preventive maintenance (PM) activities, in …
A modified colonial competitive algorithm for the mixed-model U-line balancing and sequencing problem
K Lian, C Zhang, L Gao, X Shao - International Journal of …, 2012 - Taylor & Francis
Implementation of mixed-model U-shaped assembly lines (MMUL) is emerging and thriving
in modern manufacturing systems owing to adaptation to changes in market demand and …
in modern manufacturing systems owing to adaptation to changes in market demand and …
Heuristics for an assembly flow-shop with non-identical assembly machines and sequence dependent setup times to minimize sum of holding and delay costs
This paper addresses the two-stage assembly flow-shop scheduling problem with non-
identical assembly machines at the second stage to minimize a sum of holding and delay …
identical assembly machines at the second stage to minimize a sum of holding and delay …