TY - JOUR
T1 - The mixed-product assembly line sequencing problem of a door-lock company in Taiwan
AU - Lin, Dung Ying
AU - Chu, Yi Ming
N1 - Copyright:
Copyright 2017 Elsevier B.V., All rights reserved.
PY - 2013
Y1 - 2013
N2 - This paper investigates the mixed-product assembly line sequencing problem in the door-lock manufacturing industry. Companies in the door-lock industries schedule their production processes to minimize their costs while meeting customer demand. The variances and diversities of each lock's components complicate the mixed-product assembly line sequencing problem and directly influence the material requirement planning and human resource costs. In the current research, we study one of the largest ironware manufacturing companies in Asia, company F. For this company, an export-oriented strategy makes its main products (such as door locks and door closers) available around the globe. The primary customers of company F are the largest home improvement co-op stores (such as Home Depot, Lowe's and True Value in the US) from the region of North America. The sales from this region account for over 80% of company F's total sales. The remaining company sales are geographically distributed around the world in areas such as Europe, Asia and Australia. However, as labor cost is the major concern, this company seeks supply sources in southeast Asia, China and Taiwan. In this paper, we analyze company F and formulate an integer programming mathematical model with constraints regarding production lines, labor, warehouse capacity and order fulfillment rates to minimize the total cost. The customer demand is derived from real data from company F. We use the branch and bound algorithm (CPLEX) to solve this problem and analyze the results. Salient results and practical issues involved in this unique problem are discussed in detail in this paper.
AB - This paper investigates the mixed-product assembly line sequencing problem in the door-lock manufacturing industry. Companies in the door-lock industries schedule their production processes to minimize their costs while meeting customer demand. The variances and diversities of each lock's components complicate the mixed-product assembly line sequencing problem and directly influence the material requirement planning and human resource costs. In the current research, we study one of the largest ironware manufacturing companies in Asia, company F. For this company, an export-oriented strategy makes its main products (such as door locks and door closers) available around the globe. The primary customers of company F are the largest home improvement co-op stores (such as Home Depot, Lowe's and True Value in the US) from the region of North America. The sales from this region account for over 80% of company F's total sales. The remaining company sales are geographically distributed around the world in areas such as Europe, Asia and Australia. However, as labor cost is the major concern, this company seeks supply sources in southeast Asia, China and Taiwan. In this paper, we analyze company F and formulate an integer programming mathematical model with constraints regarding production lines, labor, warehouse capacity and order fulfillment rates to minimize the total cost. The customer demand is derived from real data from company F. We use the branch and bound algorithm (CPLEX) to solve this problem and analyze the results. Salient results and practical issues involved in this unique problem are discussed in detail in this paper.
UR - http://www.scopus.com/inward/record.url?scp=84881609807&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84881609807&partnerID=8YFLogxK
U2 - 10.1016/j.cie.2012.08.010
DO - 10.1016/j.cie.2012.08.010
M3 - Article
AN - SCOPUS:84881609807
VL - 64
SP - 492
EP - 499
JO - Computers and Industrial Engineering
JF - Computers and Industrial Engineering
SN - 0360-8352
IS - 1
ER -