Heijunka mixed model sequencing problem with no buffers and work overload minimization

Other authors

Universitat Politècnica de Catalunya. Departament d'Organització d'Empreses

Universitat Politècnica de Catalunya. SIR-OPE - Service and Industrial Robotics - Operation, Production and Enterprise

Publication date

2024-04-26

Abstract

A sequence problem is presented in production lines of mixed fixed-cycle models and time windows with the aim of minimizing production losses in the line and taking into account two types of restrictions: leveling of Heijunka production and suppression of buffers between workstations. The proposed problem is solved by mixed integer linear programming (MILP) using the IBM-CPLEX solver on the set of 23 Nissan-9Eng.I instances. It is concluded that the economic impact due to incremental production losses is significant when the buffers are suppressed in the production line, being of the order of €2600/day.


Work subsidized by the Ministry of Science and Innovation of the Government of Spain / FEDER through the OPTHEUS project (ref. PGC2018–095080-B-I00)


Postprint (author's final draft)

Document Type

Part of book or chapter of book

Language

English

Publisher

Springer

Related items

https://link.springer.com/book/10.1007/978-3-031-57996-7

Recommended citation

This citation was generated automatically.

Rights

Restricted access - publisher's policy

This item appears in the following Collection(s)

E-prints [72986]