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 条

[21] An ensemble discrete differential evolution for the distributed blocking flowshop scheduling with minimizing makespan criterion
Zhao, Fuqing
Zhao, Lexi
Wang, Ling
Song, Houbin
[J]. EXPERT SYSTEMS WITH APPLICATIONS, 2020, 160
[22] An improved procedure for solving minimum makespan on a flowshop
Freud, David
Elalouf, Amir
[J]. 2022 8TH INTERNATIONAL CONFERENCE ON CONTROL, DECISION AND INFORMATION TECHNOLOGIES (CODIT'22), 2022, : 1630 - 1634
[23] An enhanced invasive weed optimization for makespan minimization in a flexible flowshop scheduling problem
[J]. Jolai, F. (fjolai@ut.ac.ir), 1600, Sharif University of Technology (21):
[24] A makespan study of the two-machine flowshop scheduling problem with a learning effect
Wu, Chin-Chia
[J]. JOURNAL OF STATISTICS & MANAGEMENT SYSTEMS, 2005, 8 (01): : 13 - 25
[25] Makespan minimisation in flexible flowshop sequence-dependent group scheduling problem
Keshavarz, Taha
Salmasi, Nasser
[J]. INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 2013, 51 (20) : 6182 - 6193
[26] A Deep Reinforcement Learning Approach to the Flexible Flowshop Scheduling Problem with Makespan Minimization
Zhu, Jialin
Wang, Huangang
Zhang, Tao
[J]. PROCEEDINGS OF 2020 IEEE 9TH DATA DRIVEN CONTROL AND LEARNING SYSTEMS CONFERENCE (DDCLS'20), 2020, : 1220 - 1225
[27] An enhanced invasive weed optimization for makespan minimization in a flexible flowshop scheduling problem
Jolai, F.
Tavakkoli-Moghaddam, R.
Rabiee, M.
Gheisariha, E.
[J]. SCIENTIA IRANICA, 2014, 21 (03) : 1007 - 1020
[28] TWO-STAGE ASSEMBLY FLOWSHOP SCHEDULING PROBLEM WITH MAXIMUM LATENESS AND MAKESPAN
Allahverdi, All
Al-Anzi, Fawaz S.
[J]. PROCEEDINGS OF THE 38TH INTERNATIONAL CONFERENCE ON COMPUTERS AND INDUSTRIAL ENGINEERING, VOLS 1-3, 2008, : 2021 - 2028
[29] Minimizing energy consumption and makespan in a two-machine flowshop scheduling problem
Mansouri, S. Afshin
Aktas, Emel
[J]. JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 2016, 67 (11) : 1382 - 1394
[30] Minimizing the makespan in the two-machine flowshop scheduling problem with an availability constraint
Lee, CY
[J]. OPERATIONS RESEARCH LETTERS, 1997, 20 (03) : 129 - 139

← 1 2 3 4 5 →