Development of maze puzzle algorithm for the job shop scheduling

M.S. Kagthara and M.G. Bhatt

International Journal of Operational Research, 2022, vol. 43, issue 3, 255-270

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.

Keywords: maze puzzle; optimisation; job shop scheduling; makespan; MATLAB; jumping; rotation. (search for similar items in EconPapers)
Date: 2022
References: Add references at CitEc
Citations:

Downloads: (external link)
http://www.inderscience.com/link.php?id=122333 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:ids:ijores:v:43:y:2022:i:3:p:255-270

Access Statistics for this article

More articles in International Journal of Operational Research from Inderscience Enterprises Ltd
Bibliographic data for series maintained by Sarah Parker ().