Deterministic Testbed Problems for Scheduling in Job Shops’ Based Manufacturing Configuration

Job shop configurations are complex and possess realistic environments. Generating an optimal and readily executable production schedule for job shop is highly important to meet the customer needs. Various researches have proposed viable and competitive algorithms to solve job shop scheduling problem. They have tested the proposed algorithms on their own hypothetically created testbed problems as well as on the others testbed problems to validate the performance. The search for an appropriate testbed problem is always found challenging for novices in this field of research. Therefore, this article is presenting a review of job shop scheduling testbed problems available in the literature. However, the review has been limited to the deterministic testbed problem. As a result, newcomers can conveniently find a compilation of widely recognized testbed problems in a single resource, eliminating the need to extensively explore the literature to assess and validate the efficacy of their proposed approach against existing job shop scheduling methods. Hence, in the present paper, various conclusions have been drawn during this review, including the future research directions emerged.