Branch and bound algorithm for solving the total weighted tardiness criterion for the permutation flowshop scheduling problem with time lags

Abstract

This paper deals with the permutation flowshop scheduling problem with time lags constraints to minimize the total weighted tardiness criterion by using the Branch and Bound algorithm. A new lower bound was developed for the flowshop scheduling problem. The computational experiments indicate that the proposed algorithm provides good solution in terms of quality and time requirements.

The Energy of rough neutrosophic matrix and its application to MCDM problem for selecting the best building construction site

“…The objective of the study is to establish a causal relationship between the illness and the patient's symptoms and to examine the patient's state using a rough neutrosophic set. The notions of the neutrosophic soft set with rough set theory (Das et al, 2021), neutrosophic single-valued rough sets, and including topology (Jin et al, 2021;Almathkour et al,, 2022) will be further developed. The rough set is important in every field of the neutrosophic environment as result.…”