Abstract Recently, The issue of energy consumption has become an that is often considered, and the manufacturing sector contributes to most significant proportion this problem. Energy-Efficient Permutation Flow Shop Scheduling Problem (EEPFSP) effective way solve This research offers a new algorithm Hybrid Multi-Verse Optimizer Algorithm (HMVO). Siz experiments are presented minimize total cons...

The permutation flow shop problem (PFSSP) is an NP-hard problem of wide engineering and theoretical background. In this paper, a biogeography based optimization (BBO) based on memetic algorithm, named HBBO is proposed for PFSSP. Firstly, to make BBO suitable for PFSSP, a new LRV rule based on random key is introduced to convert the continuous position in BBO to the discrete job permutation. Sec...

In a two-machine flow shop scheduling problem, the set of approximate sequences (i.e., solutions within a factor 1+ of the optimal) can be mapped to the vertices of a permutation lattice. We introduce two approaches, based on properties derived from the analysis of permutation lattices, for characterizing large sets of near-optimal solutions. In the first approach, we look for a sequence of min...

flow shop sequencing problem is included in np-hard problems and a number of heuristic methods have been developed to solve it. most of these methods are offered for the crisp processing time. however fuzzy algorithm is appropriate for the problems with fuzzy processing time. this paper presents a method in which an algorithm is used to minimize make span of flow shop with fuzzy processing time...

this paper presents a mathematical model for a flow shop scheduling problem consisting of m machine and n jobs with fuzzy processing times that can be estimated as independent stochastic or fuzzy numbers. in the traditional flow shop scheduling problem, the typical objective is to minimize the makespan). however,, two significant criteria for each schedule in stochastic models are: expectable m...

By taking advantage of niche sharing scheme,we propose a novel co-evolutionary particle swarm optimization algorithm (NCPSO) to solve permutation flow shop scheduling problem. As the core of this algorithm, niche sharing scheme maximizes the diversity of population and hence improves the quality of individuals. To evaluate the performance of the proposed algorithm, we have use eight Taillard in...

This paper addresses a Permutation Flow-shop Scheduling Problem (PFSP) where there is a finite number of transporters between any two successive machines to carry jobs from one machine to the subsequent machine. In order to solve the problem, an effective Anarchic Society Optimization (ASO) algorithm is developed to find a sequence of jobs with nearly-minimum makespan. The proposed ASO algorith...

Make-to-order is a production strategy in which manufacturing starts only after a customer's order is received; in other words, it is a pull-type supply chain operation since manufacturing is carried out as soon as the demand is confirmed. This paper studies the order acceptance problem with weighted tardiness penalties in permutation flow shop scheduling with MTO production strategy, the objec...

In this work we present a metaheuristic method based on tabu search for solving the permutation flow shop scheduling problem with sequence dependent setup times, with the objective of minimizing total weighted tardiness. The problem is well known for its practical applications and for the difficulty in obtaining good solutions. The tabu search method proposed is based on the insertion neighborh...

This paper proposes a metaheuristic to solve the permutation flow shop scheduling problem where several criteria are to be considered, i.e., the makespan, total flowtime and total tardiness of jobs. The proposed metaheuristic is based on tabu search algorithm. The Compromise Programming model and the concept of satisfaction functions are utilized to integrate explicitly the manager’s preference...