An Improved Monkey Search Algorithm to Solve the Flexible Job Shop Scheduling Problems With Makespan Objective

View Sample PDF

Author(s): Mariappan Kadarkarainadar Marichelvam (Mepco Schlenk Engineering College, India)and Geetha M. (Kamaraj College of Engineering and Technology, India)
Copyright: 2021
Pages: 14
Source title: Encyclopedia of Organizational Knowledge, Administration, and Technology
Source Author(s)/Editor(s): Mehdi Khosrow-Pour D.B.A. (Information Resources Management Association, USA)
DOI: 10.4018/978-1-7998-3473-1.ch053

Keywords: Administration & Leadership / Business & Management / Business and Organizational Research / Business Science Reference

Purchase

View An Improved Monkey Search Algorithm to Solve the Flexible Job Shop Scheduling Problems With Makespan Objective on the publisher's website for pricing and purchasing information.

Abstract

This work proposes a hybrid monkey search algorithm (HMSA) to solve the flexible job shop scheduling problem (FJSP) to minimize the makespan. The FJSP is a simple scheduling model that resembles numerous industrial production processes and the FJSP has been proved to be strongly NP-hard. Due to both theoretical and practical significance of FJSP, numerous researchers tackled the FJSP using different approaches. In this paper, the variable neighbourhood search (VNS) algorithm is combined with the monkey search algorithm (MSA) to enhance the solution quality. Benchmark problems are considered for validating the performance of the proposed algorithm. The computational results confirm the supremacy of the proposed HMSA for the benchmark problem.

The IRMA Community

Research IRM

An Improved Monkey Search Algorithm to Solve the Flexible Job Shop Scheduling Problems With Makespan Objective

Purchase

Abstract

Related Content

IRMA Sponsors