排序方式: 共有1条查询结果,搜索用时 0 毫秒
1
1.
Behdin Vahedi-Nouri Parviz Fattahi Mohammad Rohaninejad Reza Tavakkoli-Moghaddam 《Applied Mathematical Modelling》2013
This paper considers a single machine scheduling problem with the learning effect and multiple availability constraints that minimizes the total completion time. To solve this problem, a new binary integer programming model is presented, and a branch-and-bound algorithm is also developed for solving the given problem optimally. Since the problem is strongly NP-hard, to find the near-optimal solution for large-sized problems within a reasonable time, two meta-heuristics; namely, genetic algorithm and simulated annealing are developed. Finally, the computational results are provided to compare the result of the binary integer programming, branch-and-bound algorithm, genetic algorithm and simulated annealing. Then, the efficiency of the proposed algorithms is discussed. 相似文献
1