期刊
INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY
卷 59, 期 9-12, 页码 1157-1165出版社
SPRINGER LONDON LTD
DOI: 10.1007/s00170-011-3548-3
关键词
Batch processing; Openshop; Non-identical processing times; Simulated annealing; Genetic algorithms
This paper addresses batch processing problem on the multimachine openshop. In the batch processing problem, jobs are categorized into batches and the batches are processed by machines. The processing time of each batch equals the maximum processing time of the batch jobs. The objective is to minimize the makespan. We assume non-identical processing time jobs. We used metaheuristic algorithms, including simulated annealing and genetic algorithms to solve the problem. Several numerical experiments show that for the small size problems, the proposed methods generate the solutions by no deviation or a little deviation from the global optimum. Furthermore, for the large-size problems, the proposed methods generate better solutions in a few times as compared to the commercial optimization software Lingo 8.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据