Multi-objective flow shop scheduling problem with stochastic parameters: fuzzy goal programming approach (Q2627534)

From MaRDI portal
Revision as of 07:54, 5 March 2024 by Import240304020342 (talk | contribs) (Set profile property.)
scientific article
Language Label Description Also known as
English
Multi-objective flow shop scheduling problem with stochastic parameters: fuzzy goal programming approach
scientific article

    Statements

    Multi-objective flow shop scheduling problem with stochastic parameters: fuzzy goal programming approach (English)
    0 references
    0 references
    0 references
    31 May 2017
    0 references
    Summary: Flow shop scheduling problem with stochastic parameters is dealt with in this paper. A multi-objective mixed integer linear programming model is proposed in this concern which can generate non-permutation schedules. To provide a more realistic model, process time and release time are considered stochastic variables with normal distribution. The objective functions are minimising three performance measures including maximum completion time (Makespan), total flow time and total tardiness. Chance constrained programming (CCP) approach and fuzzy goal programming (FGP) are applied to deal with the stochastic parameters and multi-objective function. Due to the complexity of the problem, we have implemented an adapted genetic algorithm to solve large-sized problem. According to the computational experiments, the GA can reach good-quality solutions in reasonable computational time, and can be used to solve large scale problems effectively.
    0 references
    flow shop scheduling
    0 references
    multi-objective scheduling
    0 references
    mixed integer linear programming
    0 references
    MILP
    0 references
    fuzzy goal programming
    0 references
    FGP
    0 references
    genetic algorithms
    0 references
    chance constrained programming
    0 references
    CCP
    0 references
    stochastic parameters
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references