TY - JOUR ID - 71912 TI - Achieving an Optimal Lower Bound for Two Stage Supply Chain Scheduling with Regard to the Different Setup Time JO - Advances in Industrial Engineering JA - AIE LA - en SN - AU - Saberinasab, Javad AU - Sahraeian, Rashed AU - Rohaninejad, Mohammad AD - Y1 - 2018 PY - 2018 VL - 52 IS - 3 SP - 421 EP - 431 KW - Supply Chain Scheduling KW - Setup Time KW - Batch Delivery KW - Lower Bound DO - 10.22059/jieng.2019.208981.1149 N2 - In this paper, a two-stage supply-chain scheduling problem including manufacturers and distributors will be investigated and modeled. The objective function is to minimize the makespan, which is equivalent to the completion time of the last job to leave the system. A minimum makespan usually implies a good utilization of the machine(s). In this research, serial batching machines do jobs processing and then the jobs will deliver to customers (in the next stage) for further processing. The capacity of each batch is limited. Delivery unit cost of each batch is fixed and independent of the number of jobs in the batch. Processing and setup time of jobs are varying according to jobs types. The setup time is determined according to jobs type within each batch. The problem has been formulated as a mixed integer-programming model. Finally, a lower bound will be provided. Computational experiments demonstrate the performance of new lower band. UR - https://aie.ut.ac.ir/article_71912.html L1 - https://aie.ut.ac.ir/article_71912_e065b6ec48b725faec75b536afdbf933.pdf ER -