Title: | Development of maze puzzle algorithm for the job shop scheduling |
Authors: | Kagthara, M.S. Bhatt, M.G. |
Keywords: | maze puzzle optimisation job shop scheduling makespan MATLAB jumping rotation. |
Issue Date: | 2022 |
Publisher: | International Journal of Operational Research |
Abstract: | Maze puzzle concept has been introduced for solving job shop scheduling problem. Maze puzzle algorithm (MPA) is based on rotation and random jumping which explores the solution space as well as exploits the solution near to optimum. Coding is done using MATLAB software, and benchmark problem is evaluated for assessing efficiency of the algorithm. The algorithm can be used for optimisation of makespan for the given problem. The results are compared with other methods like GA, SA, SBI, SBII, PSO, BBO and TS, and found better than GA, SA, SBI, PSO, BBO but poor than SB-2 and TS. |
URI: | http://10.9.150.37:8080/dspace//handle/atmiyauni/2247 |
ISSN: | 1745-7653 |
Appears in Collections: | 01 Journal Articles |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
Development of maze puzzle algorithm for the job shop scheduling.pdf | 168.68 kB | Adobe PDF | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.