Exact and heuristic procedures for the Heijunka-flow shop scheduling problem with minimum makespan and job replicas
Cita com:
hdl:2117/358324
Tipus de documentArticle
Data publicació2021-07-03
EditorSpringer
Condicions d'accésAccés obert
Llevat que s'hi indiqui el contrari, els
continguts d'aquesta obra estan subjectes a la llicència de Creative Commons
:
Reconeixement-NoComercial-SenseObraDerivada 4.0 Internacional
Abstract
In this paper, a new problem of job sequences in a workshop is presented, taking into account non-unit demands for the jobs and whose objective is to minimize the total completion time for all the jobs (Cmax) satisfying a set of restrictions imposed on the problem to preserve the production mix. Two procedures are proposed to solve the new problem: Mixed Integer Linear Programming and a Metaheuristic based on Multistart and Local Search. The two proposed procedures are tested using instance set Nissan-9Eng.I, in both cases giving rise to highly satisfactory performance both in quality of solutions obtained and in the CPU times required. Through a case study of the Nissan engine manufacturing plant in Barcelona, our economic-productive analysis reveals that it is possible to save an average of € 1162.83 per day, manufacturing 270 engines, when we transform the current assembly line into a Heijunka-Flow Shop.
CitacióBautista, J. Exact and heuristic procedures for the Heijunka-flow shop scheduling problem with minimum makespan and job replicas. "Progress in Artificial Intelligence", 3 Juliol 2021, vol. 10, núm. 4, p. 465-488.
ISSN2192-6352
Versió de l'editorhttps://link.springer.com/article/10.1007%2Fs13748-021-00249-z
Fitxers | Descripció | Mida | Format | Visualitza |
---|---|---|---|---|
Bautista-Valhon ... HeuristicProceduresFor.pdf | 7,574Mb | Visualitza/Obre |