Electromagnetism-like mechanism and simulated annealing algorithms for flowshop scheduling problems minimizing the total weighted tardiness and makespan

Authors:
B. Naderi;R. Tavakkoli-Moghaddam;M. Khalili
Affiliations:
Department of Industrial Engineering, Amirkabir University of Technology, Tehran, Iran;Department of Industrial Engineering, College of Engineering, University of Tehran, Tehran, Iran;Department of Industrial Engineering, Islamic Azad University - Karaj Branch, Karaj, Iran
Venue:
Knowledge-Based Systems
Year:
2010

Citing 8
Cited 10

A genetic algorithm for flowshop sequencing

Computers and Operations Research - Special issue on genetic algorithms
Minmax earliness/tardiness scheduling in identical parallel machine system using genetic algorithms

ICC&IE '94 Proceedings of the 17th international conference on Computers and industrial engineering
Hybrid flow shop scheduling: a survey

Computers and Industrial Engineering
Makespan minimization for flow-shop problems with transportation times and a single robot

Discrete Applied Mathematics - Special issue on the combinatorial optimization symposium
An Electromagnetism-like Mechanism for Global Optimization

Journal of Global Optimization
Design and Analysis of Experiments

Design and Analysis of Experiments
A memetic algorithm for the flexible flow line scheduling problem with processor blocking

Computers and Operations Research
Integrating simulation and optimization to schedule a hybrid flow shop with maintenance constraints

Computers and Industrial Engineering

Modular design of a hybrid genetic algorithm for a flexible job-shop scheduling problem

Knowledge-Based Systems
A hybridization of simulated annealing and electromagnetism-like mechanism for a periodic job shop scheduling problem

Expert Systems with Applications: An International Journal
Parallel machine scheduling problem to minimize the makespan with resource dependent processing times

Applied Soft Computing
Circle detection using electro-magnetism optimization

Information Sciences: an International Journal
A two-stage hybrid particle swarm optimization algorithm for the stochastic job shop scheduling problem

Knowledge-Based Systems
A decision support system for managing combinatorial problems in container terminals

Knowledge-Based Systems
A bi-objective possibilistic programming model for open shop scheduling problems with sequence-dependent setup times, fuzzy processing times, and fuzzy due dates

Applied Soft Computing
A discrete electromagnetism-like mechanism for single machine total weighted tardiness problem with sequence-dependent setup times

Applied Soft Computing
Self-Optimization module for Scheduling using Case-based Reasoning

Applied Soft Computing
A hybrid Electromagnetism-like Mechanism/tabu search procedure for the single machine scheduling problem with a maximum lateness objective

Computers and Industrial Engineering

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents an efficient meta-heuristic algorithm based on electromagnetism-like mechanism (EM), in which has been successfully implemented in a few combinatorial problems. We propose the EM for scheduling the flow shop problem that minimizes the makespan and total weighted tardiness and considers transportation times between machines and stage skipping (i.e., some jobs may not need to be processed on all the machines). To show the efficiency of this proposed algorithm, we also apply simulated annealing (SA) and some other well-recognized constructive heuristics, such as SPT, NEH, (g/2, g/2) Johnson' rule, EWDD, SLACK, and NEH_EWDD for the given problems. To evaluate the performance and robustness of our proposed EM, we experiment a number of test problems. Our computational results show that our proposed EM in almost all cases outperforms SA and other foregoing heuristics applied to this paper.