.png){kind=icon}
.png){kind=icon}
Return
An exact branch-and-bound algorithm for seru scheduling problems with sequence-dependent setup time
.png){kind=icon}
OA
AI
DOI：10.1007/s00500-023-07846-1.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
This paper focuses on seru scheduling problems considering the sequence-dependent setup time in seru production system, which is a new-type manufacturing system originated in Japanese production practice recently that can better adapt to the fluctuate market demand. A mixed integer programming (MIP) model with the objective of minimizing the sum of the makespan and the total weighted tardiness is constructed for the seru scheduling problem. The branch-and-bound (B&B) algorithm with two main steps is designed subsequently, where the first step solves the assignment of products to serus, while the second step solves the scheduling optimization in each seru. Finally, the computational experiments and comparative analysis with CPLEX 12.8 are made, and the report of results verifies that the effectiveness and practicability of the proposed MIP and B&B algorithm.
Keywords:
Scheduling
Seru production system
Branch-and-bound
Sequence-dependent setup time