Mixed integer linear programming models for Flow Shop Scheduling with a demand plan of job types
Visualitza/Obre
Cita com:
hdl:2117/119234
Tipus de documentArticle
Data publicació2018-05-29
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 3.0 Espanya
Abstract
This paper presents two mixed integer linear programming (MILP) models that extend two basic Flow Shop Scheduling problems: Fm/prmu/Cmax and Fm/block/Cmax. This extension incorporates the concept of an overall demand plan for types of jobs or products. After using an example to illustrate the new problems under study, we evaluated the new models and analyzed their behaviors when applied to instances found in the literature and industrial instances of a case study from Nissan’s plant in Barcelona. CPLEX solver was used as a solution tool and obtained acceptable results, allowing us to conclude that MILP can be used as a method for solving Flow Shop Scheduling problems with an overall demand plan.
Descripció
This is a post-peer-review, pre-copyedit version of an article published in Central european journal of operations research. The final authenticated version is available online at: http://www.doi.org/10.1007/s10100-018-0553-8
CitacióBautista, J., Alfaro, R. Mixed integer linear programming models for Flow Shop Scheduling with a demand plan of job types. "Central european journal of operations research", 29 Maig 2018, p. 1-19.
ISSN1435-246X
Versió de l'editorhttps://link.springer.com/article/10.1007%2Fs10100-018-0553-8#citeas
Fitxers | Descripció | Mida | Format | Visualitza |
---|---|---|---|---|
CEJOR_2018_BFSP_PostPrint.pdf | 301,9Kb | Visualitza/Obre |