Mixed integer linear programming models for Flow Shop Scheduling with a demand plan of job types

被引：13

作者：

Bautista-Valhondo, Joaquin ^{[1
]}

Alfaro-Pozo, Rocio ^{[2
]}

机构：

[1] Univ Politecn Cataluna, IOC ETSEIB, E-08028 Barcelona, Spain

[2] EAE Business Sch, Barcelona 08015, Spain

来源：

CENTRAL EUROPEAN JOURNAL OF OPERATIONS RESEARCH | 2020年 / 28卷 / 01期

关键词：

Flow Shop Scheduling problem; Mixed model sequencing problem; Mixed model assembly lines; Overall demand plan; Mixed integer linear programming; PERMUTATION FLOWSHOP; MINIMIZING MAKESPAN; BLOCKING; ALGORITHM; SYSTEM; HEURISTICS; MACHINE;

D O I：

10.1007/s10100-018-0553-8

中图分类号：

C93 [管理学]; O22 [运筹学];

学科分类号：

070105 ; 12 ; 1201 ; 1202 ; 120202 ;

摘要：

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.

引用

页码：5 / 23

页数：19

共 29 条

[1] Minimizing the makespan for the flow shop scheduling problem with availability constraints
Aggoune, R
[J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2004, 153 (03) : 534 - 543
[2] [Anonymous], CLOSING GAP PRACTICE
[3] Solving the Fm|block|Cmax problem using Bounded Dynamic Programming
Bautista, Joaquin
Cano, Alberto
Companys, Ramon
Ribas, Imma
[J]. ENGINEERING APPLICATIONS OF ARTIFICIAL INTELLIGENCE, 2012, 25 (06) : 1235 - 1245
[4] Solving mixed model sequencing problem in assembly lines with serial workstations with work overload minimisation and interruption rules
Bautista, Joaquin
Cano, Alberto
[J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2011, 210 (03) : 495 - 513
[5] An expert system to minimize operational costs in mixed-model sequencing problems with activity factor
Bautista-Valhondo, Joaquin
Alfaro-Pozo, Rocio
[J]. EXPERT SYSTEMS WITH APPLICATIONS, 2018, 104 : 185 - 201
[6] Minimizing makespan in a blocking flowshop using genetic algorithms
Caraffa, V
Ianes, S
Bagchi, TP
Sriskandarajah, C
[J]. INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS, 2001, 70 (02) : 101 - 115
[7] A new vision of approximate methods for the permutation flowshop to minimise makespan: State-of-the-art and computational evaluation
Fernandez-Viagas, Victor
Ruiz, Ruben
Framinan, Jose M.
[J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2017, 257 (03) : 707 - 721
[8] The permutation flow shop problem with blocking. A tabu search approach
Grabowski, Jozef
Pempera, Jaroslaw
[J]. OMEGA-INTERNATIONAL JOURNAL OF MANAGEMENT SCIENCE, 2007, 35 (03): : 302 - 311
[9] Graham R. L., 1979, Discrete Optimisation, P287
[10] A survey of machine scheduling problems with blocking and no-wait in process
Hall, NG
Sriskandarajah, C
[J]. OPERATIONS RESEARCH, 1996, 44 (03) : 510 - 525

← 1 2 3 →