No abstract

No abstract

In this paper, the no-wait flow shop scheduling problem under makespan and flowtime criteria is addressed. The no-wait flowshop is a variant of the wellknown flowshop scheduling problem where all processes follow the previous one without any interruption for operations of a job. Owing to the problem is known to be NP-hard for more than two machines, a hybrid meta-heuristic algorithm based on ant colony optimization (ACO) and simulated annealing (SA) algorithm is improved. First, at each step, due to the characteristic of ACO algorithm that include solution construction and pheromone trail updating, some different areas of search space are checked and best solution is selected. Then, to enhance the quality and diversity of the solution and finding best neighbor of this solution, a novel SA is presented. Moreover, a new principle is applied for global pheromone update based on the probability function like SA algorithm. The proposed approach solution is compared with several the state-of-the-art algorithms in the literature. The reported results show that the proposed algorithms are effective and the new approach for local search in ACO algorithm is efficient for solving the no-wait flow shop problem. Then, we employed another hybrid ACO algorithm based on hybridization of ACO with variable neighborhood search (VNS) and compare the results given by two proposed algorithms. These results show that our new hybrid provides better results than ACO-VNS algorithm.

The flow shop scheduling problems with mixed blocking constraints with minimization of makespan are investigated. The Taguchi orthogonal arrays and path relinking along with some efficient local search methods are used to develop a metaheuristic algorithm based on bee colony optimization. In order to compare the performance of the proposed algorithm, two well-known test problems are considered. Computational results show that the presented algorithm has comparative performance with well-known algorithms of the literature, especially for the large sized problems.

Toxicity prediction using quantitative structure–activity relationship has achieved significant progress in recent years. However, most existing machine learning methods in toxicity prediction utilize only one type of feature representation and one type of neural network, which essentially restricts their performance. Moreover, methods that use more than one type of feature representation struggle with the aggregation of information captured within the features since they use predetermined aggregation formulas. In this paper, we propose a deep learning framework for quantitative toxicity prediction using five individual base deep learning models and their own base feature representations. We then propose to adopt a meta ensemble approach using another separate deep learning model to perform aggregation of the outputs of the individual base deep learning models. We train our deep learning models in a weighted multitask fashion combining four quantitative toxicity data sets of LD 50 , IGC 50 , LC 50 , and LC 50 -DM and minimizing the root-mean-square errors. Compared to the current state-of-the-art toxicity prediction method TopTox on LD 50 , IGC 50 , and LC 50 -DM, that is, three out of four data sets, our method, respectively, obtains 5.46, 16.67, and 6.34% better root-mean-square errors, 6.41, 11.80, and 12.16% better mean absolute errors, and 5.21, 7.36, and 2.54% better coefficients of determination. We named our method QuantitativeTox, and our implementation is available from the GitHub repository .