Job shop scheduling with transportation delays and layout planning in manufacturing systems: a multi-objective evolutionary approach

Authors:
Kazi Shah Nawaz Ripon;Kyrre Glette;Mats Hovin;Jim Torresen
Affiliations:
Department of Informatics, University of Oslo, Norway;Department of Informatics, University of Oslo, Norway;Department of Informatics, University of Oslo, Norway;Department of Informatics, University of Oslo, Norway
Venue:
AIS'12 Proceedings of the Third international conference on Autonomous and Intelligent Systems
Year:
2012

Citing 3
Cited 0

Pareto Optimal Based Evolutionary Approach for Solving Multi-Objective Facility Layout Problem

ICONIP '09 Proceedings of the 16th International Conference on Neural Information Processing: Part II
New codification schemas for scheduling with genetic algorithms

IWINAC'05 Proceedings of the First international work-conference on the Interplay Between Natural and Artificial Computation conference on Artificial Intelligence and Knowledge Engineering Applications: a bioinspired approach - Volume Part II
A fast and elitist multiobjective genetic algorithm: NSGA-II

IEEE Transactions on Evolutionary Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

The job shop scheduling problem (JSSP) and the facility layout planning (FLP) are two important factors influencing productivity and cost-controlling activities in any manufacturing system. In the past, a number of attempts have been made to solve these stubborn problems. Although, these two problems are strongly interconnected and solution of one significantly impacts the performance of other, so far, these problems are solved independently. Also, the majority of studies on JSSPs assume that the transportation delays among machines are negligible. In this paper, we introduce a general method using multi-objective genetic algorithm for solving the integrated problems of the FLP and the JSSP considering transportation delay having three objectives to optimize: makespan, total material handling costs, and closeness rating score. The proposed method makes use of Pareto dominance relationship to optimize multiple objectives simultaneously and a set of non-dominated solutions are obtained providing additional degrees of freedom for the production manager.