Two-stage hybrid flow shop batching and lot streaming with variable sublots and sequence-dependent setups

被引:38
作者
Wang, Shasha [1 ]
Kurz, Mary [1 ]
Mason, Scott Jennings [1 ]
Rashidi, Eghbal [2 ]
机构
[1] Clemson Univ, Dept Ind Engn, Clemson, SC 29634 USA
[2] Santa Clara Univ, Leavey Sch Business, Santa Clara, CA 95053 USA
关键词
Batch scheduling; lot streaming; sequence-dependent setups; incompatible product family; hybrid flow shop; SCHEDULING PROBLEMS; MULTIPLE ORDERS; ALGORITHMS; FRAMEWORK; TIMES;
D O I
10.1080/00207543.2019.1571251
中图分类号
T [工业技术];
学科分类号
08 ;
摘要
A paint manufacturing firm's customers typically place orders for two or more products simultaneously. Each product belongs to a family that denotes batching compatibility during manufacturing. Further, products can be split into several sublots to allow overlapping production in a two-stage hybrid flow shop wherein various identical, capacitated machines operate in parallel at each stage. We present a mixed-integer linear program (MILP) for this integrated batching and lot streaming problem with variable sublots, incompatible job families, and sequence-dependent setup times. The model determines the number and size of sublots for each product and the production sequencing for each sublot such that the total weighted completion time is minimised. To promote practical implementation, we develop and evaluate heuristics to efficiently solve this problem.
引用
收藏
页码:6893 / 6907
页数:15
相关论文
共 30 条
[11]   Lower bounds for minimizing total completion time in a two-machine flow shop [J].
Hoogeveen, Han ;
van Norden, Linda ;
van de Velde, Steef .
JOURNAL OF SCHEDULING, 2006, 9 (06) :559-568
[12]   Scheduling flexible flow lines with sequence-dependent setup times [J].
Kurz, ME ;
Askin, RG .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2004, 159 (01) :66-82
[13]   A heuristic-search genetic algorithm for multi-stage hybrid flow shop scheduling with single processing machines and batch processing machines [J].
Li, Dongni ;
Meng, Xianwen ;
Liang, Qiqiang ;
Zhao, Junqing .
JOURNAL OF INTELLIGENT MANUFACTURING, 2015, 26 (05) :873-890
[14]   A case study of batch scheduling for an assembly shop [J].
Lin, Rock ;
Liao, Ching-Jong .
INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS, 2012, 139 (02) :473-483
[15]   Sequence-dependent group scheduling problems in flexible flow shops [J].
Logendran, R ;
deSzoeke, P ;
Barnard, F .
INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS, 2006, 102 (01) :66-86
[16]   A matheuristic framework for batch machine scheduling problems with incompatible job families and regular sum objective [J].
Moench, Lars ;
Roob, Sebastian .
APPLIED SOFT COMPUTING, 2018, 68 :835-846
[17]   Lot streaming in the presence of learning in sublot-attached setup times and processing times [J].
Mukherjee, Niloy J. ;
Sarin, Subhash C. ;
Singh, Sanchit .
INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 2017, 55 (06) :1623-1639
[18]   A heuristic scheduling system for ceramic industrial coatings [J].
Olson, JR ;
Schniederjans, MJ .
INTERFACES, 2000, 30 (05) :16-22
[19]   A discrete artificial bee colony algorithm for the lot-streaming flow shop scheduling problem [J].
Pan, Quan-Ke ;
Tasgetiren, M. Fatih ;
Suganthan, P. N. ;
Chua, T. J. .
INFORMATION SCIENCES, 2011, 181 (12) :2455-2468
[20]   Scheduling with batching: A review [J].
Potts, CN ;
Kovalyov, MY .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2000, 120 (02) :228-249