This study will propose a new Lagrangian bound for the min-sum job-shop scheduling problem. The proposed method is an integration of two types of Lagrangian relaxation methods known as job-level and machine-level decomposition methods. It will be shown by numerical experiments that the proposed method can improve the existing lower bounds significantly.