English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

We present an algorithm that incorporates a tabu search procedure into theframework of path relinking to tackle the job shop scheduling problem (JSP).This tabu search/path relinking (TS/PR) algorithm comprises severaldistinguishing features, such as a specific relinking procedure and a referencesolution determination method. To test the performance of TS/PR, we apply it totackle almost all of the benchmark JSP instances available in the literature.The test results show that TS/PR obtains competitive results compared withstate-of-the-art algorithms for JSP in the literature, demonstrating itsefficacy in terms of both solution quality and computational efficiency. Inparticular, TS/PR is able to improve the upper bounds for 49 out of the 205tested instances and it solves a challenging instance that has remainedunsolved for over 20 years.

A Tabu Search/Path Relinking Algorithm to Solve the Job Shop Scheduling Problem