Abstract
This paper discusses the Two-Stage Guillotine Cutting Stock Problem (2GCSP) in the garment industry, namely how to determine the two-stage guillotine pattern that is used to cut fabric stocks into several certain size t-shirt materials that are produced based on the demand for each size of the shirt. 2GCSP is modeled in the form of Linear Integer Optimization and finding solutions using the Branch and Bound method. In this paper also presented a Graphical User Interface with Maple software as an interactive tool to find the best fabric stock cutting patterns. The results show that the optimal solution can be determined by solving numerically using the Branch and Bound method and Maple optimization packages. The solution is shown with an illustration of the pattern and the amount of fabric cut based on the pattern.
Highlights
The garment industry is an industry that produces apparel and apparel equipment
The problem discussed in this study is how 2GCSP in the garment industry can be stated as a Linear Integer Optimization problem
Information ml the number of different width of the shirt material mp the number of different length shirt material l(i) width of the smallest t-shirt material i-th, i = 1, ..., ml p(i) length of the smallest t-shirt material i-th, i = 1, ..., mp πl the number of cut patterns of fabric stock based on the width of the shirt material πp the number of cut patterns of fabric stock based on the length of the shirt material
Summary
The garment industry is an industry that produces apparel and apparel equipment. One of the raw materials used in the garment industry is fabric. The second stage is to determine the strip pattern to form the required t-shirt material This 2GCSP problem was found in the Merch Cons Bandung garment industry in producing T-shirts. To facilitate the industry in finding optimal patterns, applications are needed that can provide these solutions (Genova & Guliashki, 2011; Wu & Ge, 2012; Kavun et al, 2014; Widyastiti et al, 2016; Qu et al, 2017; Mikolajkova et al, 2018; Wang et al, 2019) Based on this description, the problem discussed in this study is how 2GCSP in the garment industry can be stated as a Linear Integer Optimization problem. How is the 2GCSP optimal solution using the Branch and Bound method in a case study in the Merch Cons Bandung garment industry? how the pattern finder's Graphical User Interface (GUI) provides the introduction (background, objectives, systematics) of your paper
Sign-in/Register to view highlights & summary Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: International Journal of Global Operations Research
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
