Two meta-heuristic algorithms for solving multi-objective flexible job-shop scheduling with parallel machine and maintenance constraints

Authors:
Vahid Majazi Dalfard;Ghorbanali Mohammadi
Affiliations:
Young Researchers Club, Kerman Branch, Islamic Azad University, Kerman, Iran;Shahid Bahonar University, Department of Industrial Engineering, Kerman, Iran
Venue:
Computers & Mathematics with Applications
Year:
2012

Citing 14
Cited 0

Single machine flow-time scheduling with a single breakdown

Acta Informatica
Improved hybrid simulated annealing algorithm for navigation scheduling for the two dams of the Three Gorges Project

Computers & Mathematics with Applications
Single-machine scheduling with general learning functions

Computers & Mathematics with Applications
Single machine scheduling with exponential time-dependent learning effect and past-sequence-dependent setup times

Computers & Mathematics with Applications
Scheduling a maintenance activity to minimize total weighted completion-time

Computers & Mathematics with Applications
Bi-criteria single machine scheduling problem with a learning effect: Aneja-Nair method to obtain the set of optimal sequences

Computers & Mathematics with Applications
Single machine scheduling with decreasing linear deterioration under precedence constraints

Computers & Mathematics with Applications
Complexity and algorithms for two-stage flexible flowshop scheduling with availability constraints

Computers & Mathematics with Applications
Two-machine flowshop scheduling problem with bounded processing times to minimize total completion time

Computers & Mathematics with Applications
Heuristics for the two-machine flowshop scheduling problem to minimize maximum lateness with bounded processing times

Computers & Mathematics with Applications
Single machine multiple common due dates scheduling with learning effects

Computers & Mathematics with Applications
Some single-machine scheduling problems with general effects of learning and deterioration

Computers & Mathematics with Applications
Approach by localization and multiobjective evolutionaryoptimization for flexible job-shop scheduling problems

IEEE Transactions on Systems, Man, and Cybernetics, Part C: Applications and Reviews
Approximability of two-machine no-wait flowshop scheduling with availability constraints

Operations Research Letters

Quantified Score

Hi-index	0.09

Visualization

Abstract

There are different reasons, such as a preventive maintenance, for the lack of machines in the planning horizon in real industrial environments. This paper focuses on the multi-objective flexible job-shop scheduling problem with parallel machines and maintenance cost. A new mathematical modeling was developed for the problem. Two meta-heuristic algorithms, a hybrid genetic algorithm and a simulated annealing algorithm, were applied after modeling the problem. Then, solutions of these meta-heuristic methods were compared with solutions obtained by using the software LINGO for small-scale, medium-scale, and large-scale problems in terms of time and optimality. The results showed that the applied hybrid genetic and simulated annealing algorithms were much more effective than the solutions obtained using LINGO. Finally, solutions using the simulated annealing approach were compared with solutions of the hybrid genetic algorithm.