Blocking Flowshop Scheduling Problem with Minimum Makespan and Quota Property

被引：1

作者：

Bautista-Valhondo, Joaquin ^{[1
]}

Alfaro-Pozo, Rocio ^{[1
]}

机构：

[1] Univ Politecn Cataluna, ETSEIB, Ave Diagonal 647, Barcelona 08028, Spain

来源：

IOT AND DATA SCIENCE IN ENGINEERING MANAGEMENT | 2023年 / 160卷

关键词：

Production assembly lines; Mixed model sequencing problem; Blocking flowshop scheduling problem; Heijunka; Lean manufacturing; Makespan; Mixed integer linear programming; IBM-CPLEX solver;

D O I：

10.1007/978-3-031-27915-7_34

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

A problem of sequences in production lines of mixed models is presented, transforming the production line into a blocking flowshop. The Heijunka concept is applied to the sequences, imposing compliancewith theQuota property, with the purpose of adapting the workshop to the Just in Time ideology adopted by Lean Manufacturing. The proposed problem is solved by means ofMILP using the IBM-CPLEX solver on the set of 23 Nissan-9Eng.I instances. It is concluded that the economic impact due to loss of production is very important when the buffers are removed from the production line ((sic)1,265/day), while the economic impact generated by Heijunka can be considered negligible compared to the advantages it offers ((sic)170 /day).

引用

页码：185 / 190

页数：6

共 50 条

[1] Effective heuristics for the blocking flowshop scheduling problem with makespan minimization
Pan, Quan-Ke
Wang, Ling
[J]. OMEGA-INTERNATIONAL JOURNAL OF MANAGEMENT SCIENCE, 2012, 40 (02): : 218 - 229
[2] Iterated greedy algorithms for the blocking flowshop scheduling problem with makespan criterion
Tasgetiren, M. Fatih
Kizilay, Damla
Pan, Quan-Ke
Suganthan, P. N.
[J]. COMPUTERS & OPERATIONS RESEARCH, 2017, 77 : 111 - 126
[3] An effective VNSSA algorithm for the blocking flowshop scheduling problem with makespan minimization
Zhang, Chaoyong
Xie, Zhanpeng
Shao, Xinyu
Tian, Guangdong
[J]. 2015 INTERNATIONAL CONFERENCE ON ADVANCED MECHATRONIC SYSTEMS (ICAMECHS), 2015, : 86 - 89
[4] Scheduling the distributed assembly flowshop problem to minimize the makespan
Ochi, Hanadi
Driss, Olfa Belkahla
[J]. CENTERIS2019--INTERNATIONAL CONFERENCE ON ENTERPRISE INFORMATION SYSTEMS/PROJMAN2019--INTERNATIONAL CONFERENCE ON PROJECT MANAGEMENT/HCIST2019--INTERNATIONAL CONFERENCE ON HEALTH AND SOCIAL CARE INFORMATION SYSTEMS AND TECHNOLOGIES, 2019, 164 : 471 - 477
[5] A three-phase algorithm for flowshop scheduling with blocking to minimize makespan
Wang, Cheng
Song, Shiji
Gupta, Jatinder N. D.
Wu, Cheng
[J]. COMPUTERS & OPERATIONS RESEARCH, 2012, 39 (11) : 2880 - 2887
[6] Discrete differential evolution algorithm for distributed blocking flowshop scheduling with makespan criterion
Zhang, Guanghui
Xing, Keyi
Cao, Feng
[J]. ENGINEERING APPLICATIONS OF ARTIFICIAL INTELLIGENCE, 2018, 76 : 96 - 107
[7] Makespan minimization of a flowshop sequence-dependent group scheduling problem
Nasser Salmasi
Rasaratnam Logendran
Mohammad Reza Skandari
[J]. The International Journal of Advanced Manufacturing Technology, 2011, 56 : 699 - 710
[8] Makespan minimization in the two-machine flowshop batch scheduling problem
Cheng, T.C.E.
Lin, B.M.T.
Toker, A.
[J]. 2000, John Wiley & Sons Inc, New York, NY, United States (47)
[9] Two NEH Heuristic Improvements for Flowshop Scheduling Problem with Makespan Criterion
Sauvey, Christophe
Sauer, Nathalie
[J]. ALGORITHMS, 2020, 13 (05)
[10] Makespan minimization of a flowshop sequence-dependent group scheduling problem
Salmasi, Nasser
Logendran, Rasaratnam
Skandari, Mohammad Reza
[J]. INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY, 2011, 56 (5-8): : 699 - 710

← 1 2 3 4 5 →