<em>Job shop scheduling problem (JSSP) is considered to belong to the class of NP-hard combinatorial optimization problem. Finding a solution to this problem is equivalent to solving different problems of various fields such as industry and logistics. The objective of this work is to optimize the makespan in JSSP using Golden Ball algorithm. In this paper we propose an efficient adaptation of Golden Ball algorithm to the JSSP. Numerical results are presented for 36 instances of OR-Library. The computational results show that the proposed adaptation is competitive when compared with other existing methods in the literature; it can solve the most of the benchmark instances.</em>
D-index is among the most efficient similarity search indexes, its performance dramatically depends on the choice of the ρ parameter. Although the importance of this parameter, there are no techniques or criteria proposed to choose an adequate ρ value. In this paper, we propose a criteria and a technique that ensure a good choice of ρ, and we use this technique to modify the original D-index to make it able to choose an adequate value of ρ. The experiments show that the modified D-index is more efficient when the exclusion set is small and the comparison between original and modified D-index proves that the modified D-index presents a good improvement in terms of the search cost.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.