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 makespan and the probability of minimizing the makespan. These criteria can be considered for fuzzy problems as well. In this paper, we propose a solution for the fuzzy model by the use of fuzzy logic based on developing the model presented by MacCahon [18]
This paper deals with constrained multistage machines flow-shop (FS) scheduling model in which proce...
AbstractIn practice, processing times can be more accurately represented as intervals with the most ...
This paper discusses three stage flow shop scheduling including transportation time in frame work of...
In this paper, an uninterrupted hybrid flow scheduling problem is modeled under uncertainty conditio...
Production scheduling, with the objective of minimizing the makespan, is an important task in manufa...
Purpose: In this paper, an uninterrupted hybrid flow shop scheduling problem is modeled under uncert...
AbstractThis study investigated an approach for incorporating statistics with fuzzy sets in the flow...
Purpose: In this paper, an uninterrupted hybrid flow shop scheduling problem is modeled under uncert...
This paper addresses the Hybrid Flow Shop (HFS) scheduling problems to minimize the total work in pr...
This paper presents a makespan minimization of -jobs -machines re-entrant flow shop scheduling probl...
In this paper, we propose a new algorithm to fuzzy flow – shop scheduling problem in which processin...
Various procedures, methods, constraints and objectives are studied in a flow shop problem during th...
AbstractIn this paper, we present a mixed-integer fuzzy programming model and a genetic algorithm (G...
In this paper we consider two stage flow shop scheduling to minimize the total rental cost of machin...
A flexible flow shop problem can be considered as a generalization of a pure flow shop problem in wh...
This paper deals with constrained multistage machines flow-shop (FS) scheduling model in which proce...
AbstractIn practice, processing times can be more accurately represented as intervals with the most ...
This paper discusses three stage flow shop scheduling including transportation time in frame work of...
In this paper, an uninterrupted hybrid flow scheduling problem is modeled under uncertainty conditio...
Production scheduling, with the objective of minimizing the makespan, is an important task in manufa...
Purpose: In this paper, an uninterrupted hybrid flow shop scheduling problem is modeled under uncert...
AbstractThis study investigated an approach for incorporating statistics with fuzzy sets in the flow...
Purpose: In this paper, an uninterrupted hybrid flow shop scheduling problem is modeled under uncert...
This paper addresses the Hybrid Flow Shop (HFS) scheduling problems to minimize the total work in pr...
This paper presents a makespan minimization of -jobs -machines re-entrant flow shop scheduling probl...
In this paper, we propose a new algorithm to fuzzy flow – shop scheduling problem in which processin...
Various procedures, methods, constraints and objectives are studied in a flow shop problem during th...
AbstractIn this paper, we present a mixed-integer fuzzy programming model and a genetic algorithm (G...
In this paper we consider two stage flow shop scheduling to minimize the total rental cost of machin...
A flexible flow shop problem can be considered as a generalization of a pure flow shop problem in wh...
This paper deals with constrained multistage machines flow-shop (FS) scheduling model in which proce...
AbstractIn practice, processing times can be more accurately represented as intervals with the most ...
This paper discusses three stage flow shop scheduling including transportation time in frame work of...