Minimizing the total completion time on a single machine with the learning effect and multiple availability constraints |
| |
Authors: | Behdin Vahedi-Nouri Parviz Fattahi Mohammad Rohaninejad Reza Tavakkoli-Moghaddam |
| |
Affiliation: | 1. Department of Industrial Engineering, Bu-Ali Sina University, Hamedan, Iran;2. Department of Industrial Engineering, University of Tehran, Tehran, Iran |
| |
Abstract: | 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. |
| |
Keywords: | Single machine scheduling Availability constraint Learning effect Genetic algorithm Simulated annealing |
本文献已被 ScienceDirect 等数据库收录! |
|