A new neighbourhood structure for job shop scheduling problems
Sign Up to like & getrecommendations! Published in 2022 at "International Journal of Production Research"
DOI: 10.1080/00207543.2022.2060772
Abstract: Job shop scheduling problem (JSP) is a widely studied NP-complete combinatorial optimisation problem. Neighbourhood structures play a critical role in solving JSP. At present, there are three state-of-the-art neighbourhood structures, i.e. N5, N6, and N7.… read more here.
Keywords: neighbourhood structure; neighbourhood; job shop; neighbourhood structures ... See more keywords