Title
Mixed integer linear programming models for Flow Shop Scheduling with a demand plan of job types
Abstract
This paper presents two mixed integer linear programming (MILP) models that extend two basic Flow Shop Scheduling problems: \( {\text{Fm}} \)/\( {\text{prmu}} \)/\( {\text{C}}_{ \hbox{max} } \) and \( {\text{Fm}} \)/\( {\text{block}} \)/\( {\text{C}}_{ \hbox{max} } \). 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.
Year
DOI
Venue
2020
10.1007/s10100-018-0553-8
Central European Journal of Operations Research
Keywords
Field
DocType
Flow Shop Scheduling problem, Mixed model sequencing problem, Mixed model assembly lines, Overall demand plan, Mixed integer linear programming
Discrete mathematics,Mathematical optimization,Economics,Flow shop scheduling,Integer programming,Solver
Journal
Volume
Issue
ISSN
28
1
1613-9178
Citations 
PageRank 
References 
0
0.34
12
Authors
2
Name
Order
Citations
PageRank
Joaquín Bautista134527.50
Rocío Alfaro-Pozo200.34