In this research, a new approach for tackling the permutation flow shop scheduling problem (PFSSP) is proposed. This algorithm based on steps of elitism continuous genetic improved by two strategies and used largest rank value (LRV) rule to transform values into discrete ones enabling solving combinatorial PFSSP. The first strategy combining arithmetic crossover with uniform give high capabilit...

Flow shop scheduling is a type of where sequence follows for each job on set machines processing. In practice, jobs in flow shops can arrive at irregular times, and the no-wait constraint allows changes order to flexibly manage such irregularity. The flexible problems with have mainly addressed optimization floor manufacturing, processing, allied industries. scope this paper identify literature...

This paper proposes a hybridized simheuristic approach that couples greedy randomized adaptive search procedure (GRASP), Monte Carlo simulation, Pareto archived evolution strategy (PAES), and an analytic hierarchy process (AHP), in order to solve multicriteria stochastic permutation flow shop problem with processing times sequence-dependent setup times. For the decisional criteria, proposed con...

Abstract System-wide optimization of distributed manufacturing operations enables process improvement beyond the standalone and individual optimality norms. This study addresses production planning a system consisting three stages: parts (subcomponents), assembly components in Original Equipment Manufacturer (OEM) factories, final products at product manufacturer’s factory. Distributed Three St...

The present paper is an attempt to develop a new heuristic algorithm, find the optimal sequence to minimize the utilization time of the machines and hence their rental cost for two stage specially structured flow shop scheduling under specified rental policy in which processing times and set up time are associated with their respective probabilities including transportation time. Further jo...

This paper describes a polynomial-time heuristic for the permutation flow-shop scheduling problem with the criterion of minimizing total completion time. The proposed method consists of two phases: arranging the jobs in priority order and then constructing a sequence. A new ranking method is employed to prioritize the jobs for incorporating into the construction phase of the heuristic. Computat...

In this paper, we consider a flow shop scheduling problem with availability constraints (FSSPAC) for the objective of minimizing the makespan. In such a problem, machines are not continuously available for processing jobs due to preventive maintenance activities. We proposed a mixed-integer linear programming (MILP) model for this problem which can generate non-permutation schedules. Furthermor...

The flow shop scheduling problem consists in the assignment of a set of jobs J = {J1, . . . , Jn}, each of which consists of a set of operations Jj = {Oj1, . . . , Ojoj} onto a set of machines M = {M1, . . . ,Mm} [5, 18]. Each operation Ojk is processed by at most one machine at a time, involving a non-negative processing time pjk. The result of the problem resolution is a schedule x, defining ...

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...