@article { author = {Karimi, N. and Davoudpour, H.}, title = {A Benders decomposition algorithm for multi-factory scheduling problem with batch delivery}, journal = {Scientia Iranica}, volume = {24}, number = {2}, pages = {823-833}, year = {2017}, publisher = {Sharif University of Technology}, issn = {1026-3098}, eissn = {2345-3605}, doi = {10.24200/sci.2017.4064}, abstract = {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.}, keywords = {Multi-factory scheduling,Batch delivery,Benders Decomposition,mixed-integer programming}, url = {https://scientiairanica.sharif.edu/article_4064.html}, eprint = {https://scientiairanica.sharif.edu/article_4064_aae5048c38d57ac4e2b9311cd1d1af24.pdf} }