Open-shop scheduling

Open-shop scheduling refers to a production environment where jobs can be processed in any order and there is no definite sequence of operations that a job must follow. In this environment, there are m machines that can process any of the n jobs, and each machine has a specific processing time for a given job. The open-shop scheduling problem involves determining the most efficient way to schedule these jobs on the available machines.From: Production Planning and Industrial Scheduling [2019], A new two-stage constraint programming approach for open shop scheduling problem with machine blocking [2022]

Water Drop Algorithm

View Chapter

Purchase Book

Published in Nazmul Siddique, Hojjat Adeli, Nature-Inspired Computing, 2017

Nazmul Siddique, Hojjat Adeli

The optimization objective is the makespan of the schedule. Experimental results show that the improved WDA is able to find better solutions for the standard benchmark instances than the existing algorithms. The new approach has made contribution in two aspects. Firstly, this is the first application of the improved WDA to the JSSP. This work can inspire further studies of applying the improved WDA to other scheduling problems, such as open shop scheduling and flow shop scheduling. Secondly, further improvements to the original improved WDA are made by employing five schemes to increase the diversity of the solution space as well as the solution quality. Niu et al. (2013) have also customized the improved WDA for a multiobjective JSSP. The experimental evaluation shows that the customized improved WDA can identify the Pareto nondominance schedules efficiently.

A new two-stage constraint programming approach for open shop scheduling problem with machine blocking

View Article

Journal Information

Published in International Journal of Production Research, 2022

Levi R. Abreu, Marcelo S. Nagano, Bruno A. Prata

The open shop scheduling problem is a production environment in which the jobs are processed in m machines where all the machines can process any of the n jobs, and each machine presents a specific processing time for a given job. There are no fixed routes in the machines, leading to an increase in the search space compared to the other production scheduling environments, such as flow shop or job shop, for example.

Open-shop scheduling

Explore chapters and articles related to this topic

Water Drop Algorithm

A new two-stage constraint programming approach for open shop scheduling problem with machine blocking