A branch and bound method for solving multi-factory supply chain scheduling with batch delivery

作者：

Highlights：

• Serial multi-factory supply chain scheduling is investigated for the first time.

• Batch delivery of the products is considered.

• The branch and bound algorithm is presented for this problem.

• A lower bound and an upper bound are presented to enhance the performance of the algorithm.

摘要

•Serial multi-factory supply chain scheduling is investigated for the first time.•Batch delivery of the products is considered.•The branch and bound algorithm is presented for this problem.•A lower bound and an upper bound are presented to enhance the performance of the algorithm.

论文关键词：Multi-factory scheduling,Supply chain,Batch delivery,Branch and bound,Heuristic

论文评审过程：Available online 2 August 2014.

论文官网地址：https://doi.org/10.1016/j.eswa.2014.07.025