%0 Journal Article
%T A Benders decomposition algorithm for multi-factory scheduling problem with batch delivery
%J Scientia Iranica
%I Sharif University of Technology
%Z 1026-3098
%A Karimi, N.
%A Davoudpour, H.
%D 2017
%\ 04/01/2017
%V 24
%N 2
%P 823-833
%! A Benders decomposition algorithm for multi-factory scheduling problem with batch delivery
%K Multi-factory scheduling
%K Batch delivery
%K Benders Decomposition
%K mixed-integer programming
%R 10.24200/sci.2017.4064
%X The multi-factory supply chain problem is investigated to determine the production and transportation scheduling of jobs which are allowed to be transported by batches. This is a mixed-integer optimization problem, which could be challenging to solve. The problem incorporates two parts: (1) assigning jobs to appropriate batch, and (2) scheduling jobs of batches for production and transportation. Based on the problem structure and because of its NP-hardness characteristics, Benders decomposition is recognized as a suitable approach. This approach decomposes the problem into assignment master problem and scheduling sub-problem. This would facilitate the solution procedure. By comparing performance of the proposed algorithm with an exact approach: Branch and Bound, It is achieved that it is able to find the near optimal solution in smaller computational times than the Branch and Bound.
%U https://scientiairanica.sharif.edu/article_4064_aae5048c38d57ac4e2b9311cd1d1af24.pdf