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

The goal of this paper is to investigate scheduling heuristics to seek the minimum of a positively weighted convex sum of makespan and the number of tardy jobs in a static hybrid flow shop environment where at least one production stage is made up of unrelated parallel machines. In addition, sequence and machine dependent setup times are considered. The problem is a combinatorial optimization p...

This paper considers our work in progress on the problem of scheduling production activities in a real-life manufacturing plant. The problem is modelled as a two-stage flexible flow shop problem with minimization of the makespan and the number of tardy jobs. The design approach of an evolutionary algorithm is described. Preliminary experiments are performed and results obtained show the improve...

In the present work, SDST flow shop scheduling with minimizing the weighted sum of total weighted tardiness and makespan have been considered simultaneously. Four modified heuristic have been proposed for preliminary viable sequence. Sequence obtained from the modified heuristics is combined with the initial seed sequence of genetic algorithm and called as Genetic Algorithm (GA). Hence four dif...

Minimum makespan scheduling of Flow Shops with Multiple Processors (FSMPs), also known as the Hybrid Flow Shop (HFS), is classified as NP complete. Thus, the FSMP largely depends on strong heuristics to develop solutions to makespan scheduling instances. An FSMP consists of m stages wherein each stage has one or more processors through which n jobs are scheduled. This paper presents a heuristic...

In this paper, four algorithms based on some single-pass heuristics are proposed to solve the flexible flow-shop group scheduling problems with more than two machine centers, which have the same number of parallel machines. Single-pass heuristics need less computation time than multiple-pass ones. The single-pass heuristics adopted in the paper includes the PT, the Palmer and the Gupta algorith...

A flexible flow shop problem can be considered as a generalization of a pure flow shop problem in which the jobs have to go through the stages in the same order. We consider a flexible flow shop problem with unrelated machines and setup times, where the processing times depend on the chosen machine and setup times are sequence-dependent. While for classical problems the processing times for eac...

The problem of scheduling in a Flow Shop with Multiple Processors (FSMP) is considered with the objective of minimizing the makespan for static problems. Herein, the usefulness of simulated annealing (SA) is investigated. Two stages are used in generating the makespans. A good initial-heuristic-seed sequence, obtained in the first stage, is improved-upon in the second stage by the SA technique....

Hybrid flow shop (HFS) scheduling problem is a kind of scheduling consisted of a series of stages, in which there exist more than one parallel machine. In this paper, we propose a meta-heuristics using a version of cooperative multi-swarm PSO algorithm for the HFS with minimum makespan objective. The main contribution of this algorithm is to import an electoral mechanism to accelerate the conve...

In this paper, we propose an energy-efficient mathematical model for the resource-constrained project scheduling problem to optimize makespan and consumption of energy, simultaneously. In the proposed model, resources are speed-scaling machines. The problem is NP-hard in the strong sense. Therefore, a multi-objective fruit fly optimization algorithm (MOFOA) is developed. The MOFOA uses the VIKO...