Development of maze puzzle algorithm for the job shop scheduling

dc.contributor.author	Kagthara, M.S.
dc.contributor.author	Bhatt, M.G.
dc.date.accessioned	2025-01-02T05:26:46Z
dc.date.available	2025-01-02T05:26:46Z
dc.date.issued	2022
dc.identifier.issn	1745-7653
dc.identifier.uri	http://10.9.150.37:8080/dspace//handle/atmiyauni/2247
dc.description.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.	en_US
dc.language.iso	en	en_US
dc.publisher	International Journal of Operational Research	en_US
dc.subject	maze puzzle	en_US
dc.subject	optimisation	en_US
dc.subject	job shop scheduling	en_US
dc.subject	makespan	en_US
dc.subject	MATLAB	en_US
dc.subject	jumping	en_US
dc.subject	rotation.	en_US
dc.title	Development of maze puzzle algorithm for the job shop scheduling	en_US
dc.type	Article	en_US