Lot Streaming Flow Shop with a Heterogeneous Machine

被引:8
作者
Ferraro, Augusto [1 ]
Rossit, Daniel [2 ]
Toncovich, Adrian [3 ,4 ]
Frutos, Mariano [2 ]
机构
[1] Univ Nacl Sur, Bahia Blanca, Buenos Aires, Argentina
[2] Univ Nacl Sur, Dept Engn, Bahia Blanca, Buenos Aires, Argentina
[3] Univ Nacl Sur, Prod Planning & Control, Dept Engn, Bahia Blanca, Buenos Aires, Argentina
[4] UNS, CONICET, INMABB, Bahia Blanca, Buenos Aires, Argentina
关键词
Flow Shop; Lot Streaming; Makespan; Sequence Dependent Setups; Decomposition; Operations Management; Supply Chain Management; Systems Engineering; MIGRATING BIRDS OPTIMIZATION; GENETIC ALGORITHM; SCHEDULING PROBLEM;
D O I
10.1080/10429247.2018.1522221
中图分类号
T [工业技术];
学科分类号
08 ;
摘要
It is possible to obtain greater productivity of a production system by overlapping the operations required to process a manufacturing order. This methodology, known as lot streaming, requires dividing the production order (lot) into smaller sublots. In this article, we study production systems that include machines that operate in batch mode (processing a group of units at the same time) and single processing machines (processing one unit at a time) arranged in a flow shop configuration, that is all jobs must go through the same production stages in the same order. The obtained results show that addressing the problem with consistent sublots (a common sublot size used for the whole process) is inefficient. On the other hand, addressing the problem considering the sizing of sublots for each machine (variable sublots) greatly improves the quality of the solution but is computationally intensive (limiting the size of the problem that can be solved). Therefore, a decomposition procedure is proposed on the decision of sublots sizing. This procedure greatly improves the solution obtained using consistent sublots and does so with lower computational requirements than the variable sublots approach.
引用
收藏
页码:113 / 126
页数:14
相关论文
共 50 条
[31]   A heuristic method for discrete lot streaming with variable sublots in a flow shop [J].
S. C. Liu .
The International Journal of Advanced Manufacturing Technology, 2003, 22 :662-668
[32]   Improved Meta-Heuristics for Solving Distributed Lot-Streaming Permutation Flow Shop Scheduling Problems [J].
Pan, Yuxia ;
Gao, Kaizhou ;
Li, Zhiwu ;
Wu, Naiqi .
IEEE TRANSACTIONS ON AUTOMATION SCIENCE AND ENGINEERING, 2023, 20 (01) :361-371
[33]   Lot streaming with detached setups in three-machine flow shops [J].
Chen, J ;
Steiner, G .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1997, 96 (03) :591-611
[34]   Single-lot, lot-streaming problem for a 1 + m hybrid flow shop [J].
Sanchit Singh ;
Subhash C. Sarin ;
Ming Cheng .
Journal of Global Optimization, 2024, 89 :435-455
[35]   Two-stage, single-lot, lot streaming problem for a hybrid flow shop [J].
Cheng, Ming ;
Sarin, Subhash C. ;
Singh, Sanchit .
JOURNAL OF GLOBAL OPTIMIZATION, 2016, 66 (02) :263-290
[36]   A new genetic algorithm for lot-streaming flow shop scheduling with limited capacity buffers [J].
Ventura, Jose A. ;
Yoon, Suk-Hun .
JOURNAL OF INTELLIGENT MANUFACTURING, 2013, 24 (06) :1185-1196
[37]   A new genetic algorithm for lot-streaming flow shop scheduling with limited capacity buffers [J].
José A. Ventura ;
Suk-Hun Yoon .
Journal of Intelligent Manufacturing, 2013, 24 :1185-1196
[38]   Lot streaming multiple jobs with values exponentially deteriorating over time in a job-shop environment [J].
Liu, Cheng-Hsiang ;
Chen, Long-Sheng ;
Lin, Pei-Shiun .
INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 2013, 51 (01) :202-214
[39]   Single-lot, lot-streaming problem for a 1+m hybrid flow shop [J].
Singh, Sanchit ;
Sarin, Subhash C. ;
Cheng, Ming .
JOURNAL OF GLOBAL OPTIMIZATION, 2024, 89 (02) :435-455
[40]   On the equivalence of small batch assembly line balancing and lot streaming in a flow shop [J].
Glass, Celia A. ;
Herer, Yale T. .
INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 2006, 44 (21) :4587-4606