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

Author(s)

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

• Document type: Journal article
• Source: INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH; v. N/A, p. 20-pg., 2022-12-15.

Abstract

In this paper, a variant of the open shop scheduling problem is considered in which the intermediate storage is forbidden among two adjacent production stages (zero buffer or machine blocking constraint). The performance measure is to minimise the maximal completion time of the jobs (makespan). Since this is an NP-hard problem, a two-stage constraint programming approach is proposed as a new exact method. Computational experiments were carried out on 222 literature problem instances in order to test the performance of the proposed algorithm. The relative deviation is adopted as the performance criteria. Computational results point to the ability of the proposed method to solve large-sized instances in comparison with the developed mixed-integer linear programming model and a simple constraint programming model, both with user cuts. In all set of instances, the proposed two-stage method performed better than benchmarking methods and integer programming models, with average relative deviation regarding objective values as lower as 12%. In addition, the results point to a competitive efficiency in computational times of the proposed method with less than 200 s in the most instances to obtain the optimal solution, in comparison to competitive metaheuristics from literature of the problem, for the tested test instances. (AU)

• FAPESP's process: 21/11586-2 - Contributions to new variants of the open shop scheduling problem: modeling & solution methods
• Grantee: Levi Ribeiro de Abreu
• Support Opportunities: Scholarships in Brazil - Doctorate (Direct)