The single batch-processing machine problemis to minimize makespan, which has broad applications, including engineering fundamentals and theoretical background. The machine can process several jobs as a batch simultan...
详细信息
The single batch-processing machine problemis to minimize makespan, which has broad applications, including engineering fundamentals and theoretical background. The machine can process several jobs as a batch simultaneously, and every job has three different attributes: job size, processing time, and job arrival. In this paper, a hybrid local search algorithm with path relinking (LP) is devised to solve the problem. We not only generate an optimal initial solution firstly but also pay more attention to improving the solution quality. Three kinds of local searches are applied to enhance the diversity of solutions;the path relinking is adopted to explore better solutions through local tracks connecting the current solution and the best in the elite set. With these approaches, it can keep a balanced rate between exploratory and exploitative capacity. Computational experiments on 40 benchmark instances indicate that LP has the superior convergence and robust performance and it surpasses the current state-of-the-art methods such as genetic algorithm and ant colony optimization, especially for large instances.
This paper considers a fuzzy single batch-processing machine (SBPM) scheduling problem and aims to make it closer to a real-world application through a fuzzy set theory. For this purpose, jobs' due dates are set t...
详细信息
This paper considers a fuzzy single batch-processing machine (SBPM) scheduling problem and aims to make it closer to a real-world application through a fuzzy set theory. For this purpose, jobs' due dates are set to be fuzzy numbers and the membership function of a fuzzy due date assigned to each job represents the degree of satisfaction that a decision maker has with the completion time of that job. The objective is to maximize the total degree of satisfaction or equivalently to minimize the total degree of dissatisfaction over given jobs. Then, the fuzzy mathematical programming model is presented. To solve the model, we propose the imperialist competitive algorithm (ICA) and modify the assimilation policy (i.e., colonies moving) and imperialistic competition in order to overcome its immature convergence and improve its performances. Moreover, due to the significant role of parameters on the quality of random search algorithms, a robust calibration is applied on the parameters using the Taguchi optimization technique. To evaluate the proposed ICA, several random test problems are generated and its performance is compared to the traditional ICA, simulated annealing (SA), particle swarm optimization (PSO), genetic algorithm (GA), ant colony optimization (ACO), and earliest due date (EDD). The obtained computational results demonstrate the superiority and robustness of the modified ICA.
A scheduling problem for the batch-processingmachine with non-identical job sizes is investigated. The objective is to minimize the makespan. The problem has been proved to be NP-hard. Hence, a tabu search heuristic ...
详细信息
ISBN:
(纸本)9781424473281
A scheduling problem for the batch-processingmachine with non-identical job sizes is investigated. The objective is to minimize the makespan. The problem has been proved to be NP-hard. Hence, a tabu search heuristic is proposed to solve it approximately. Besides the basic neighborhoods, three variable depth neighborhoods which are explored by the filter-and-fan method are proposed and used in the tabu search process for further improvement. The larger neighborhood can be obtained by adjusting the depth of search dynamically in the filter-and-fan method. A group of random instances are generated to test the effectiveness of the heuristic we proposed. The experimental results show that the heuristic can obtain the optimal solutions for most of the instances with small scales. And for all the instances with large scales, the heuristic significantly outperform the standard commercial solver both on run time and quality of solution.
暂无评论