Application of particle swarm optimization and simulated annealing algorithms in flow shop scheduling problem under linear deterioration

Authors:
M. Bank;S. M. T. Fatemi Ghomi;F. Jolai;J. Behnamian
Affiliations:
Department of Industrial Engineering, Amirkabir University of Technology, 424 Hafez Avenue, 1591634311 Tehran, Iran;Department of Industrial Engineering, Amirkabir University of Technology, 424 Hafez Avenue, 1591634311 Tehran, Iran;Department of Industrial Engineering, College of Engineering, University of Tehran, Tehran, Iran;Department of Industrial Engineering, Amirkabir University of Technology, 424 Hafez Avenue, 1591634311 Tehran, Iran
Venue:
Advances in Engineering Software
Year:
2012

Citing 8
Cited 3

Single facility scheduling with nonlinear processing times

Computers and Industrial Engineering
Scheduling jobs under simple linear deterioration

Computers and Operations Research
A discrete version of particle swarm optimization for flowshop scheduling problems

Computers and Operations Research
Minimising total tardiness in the m-machine flowshop problem: A review and evaluation of heuristics and metaheuristics

Computers and Operations Research
A discrete particle swarm optimization algorithm for the no-wait flowshop scheduling problem

Computers and Operations Research
A two-machine flowshop makespan scheduling problem with deteriorating jobs

Computers and Industrial Engineering
A memetic algorithm for minimizing the total weighted completion time on a single machine under step-deterioration

Advances in Engineering Software
A branch-and-bound algorithm for solving a two-machine flow shop problem with deteriorating jobs

Computers and Operations Research

Research on computational intelligence algorithms with adaptive learning approach for scheduling problems with batch processing machines

Neurocomputing
A case study on using evolutionary algorithms to optimize bakery production planning

Expert Systems with Applications: An International Journal
Minimizing resource consumption on uniform parallel machines with a bound on makespan

Computers and Operations Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper studies a permutation flow shop scheduling problem with deteriorating jobs. Deteriorating jobs are the jobs which the processing time depends on the waiting time before process starts. A particle swarm optimization algorithm with and without a proposed local search is developed to determine a job sequence with minimization of the total tardiness criterion. Furthermore, a simulated annealing is proposed to solve the problem. We compare the performance of these algorithms to achieve an optimal or near optimal solution. It is concluded that the particle swarm optimization algorithm with local search gives promising solutions. The quality of solution obtained by particle swarm optimization algorithm with local search is superior to that of the simulated annealing algorithm, but the simulated annealing algorithm takes shorter time to find a schedule solution.