Year: 2025
Type: article
Abstract: In the Open Shop Scheduling, a group of jobs are assigned to several machines, and each job can be handled on any machine without following a set order. The main difficulty is figuring out the best scheduling configuration to reduce the makespan or the amount of time needed to finish all jobs from the beginning of the first work to the end of the last. Multiple jobs requiring the same machine simultaneously can cause scheduling conflicts, which must be avoided while considering work order flexibility among different machines. Scheduling considerations in OSS are extremely complicated because every job must be executed on every machine exactly once. The goal is to determine an efficient sequence that balances the workload across available machines, minimizing makespan while adhering to various operational constraints. This survey provides a comprehensive analysis of Open Shop Scheduling, a widely studied topic in scientific research focusing on minimizing makespan, synthesizes key contributions from the literature, highlights recent advancements, and outlines potential avenues for future research.
Authors: Tabark Nameer Abd Ali, Luma S. Hasan
Institution: University of Al-Qadisiyah
Language: English
Subfield: Industrial and Manufacturing Engineering
Field: Engineering
Domain: Physical Sciences
Open Access status: diamond
OpenAlex ID: W4409197554