Papers by Keyword: Integer Linear Programming

Abstract: This research aims to optimize the production of Alfian's Cassava Stick to obtain maximum profit in Imron Rosidi's business. Alfian's Cassava Stick is a snack in Gunungkidul made from cassava. This study uses a linear programming model to determine the optimal production plan that maximizes profits while meeting production and resource constraints. Data was collected through observation, interviews and documentation. The results showed that the optimal production plan was to produce 100 packs of original cassava sticks and 200 packs of spicy cassava sticks per week. The maximum profit earned is IDR 1,200,000.00 per week. This study concludes that the linear programming model is an effective tool for optimizing the production of Alfian's Cassava Stick and maximizing profits. The findings of this research can provide insights for similar businesses in optimizing production plans and increasing their profitability.

Abstract: One of the objectives of process planning optimization is to diminish machining time. Nowadays a lot of research papers presented different algorithms to solve this classic problem. Thus, the optimal sequence of parts in the machining operations by considering fixture faces, part faces, number of operations and number of tools is presented in this paper. The mathematical model based on the integer linear programming is developed to minimize the total production time of the prismatic parts manufactured on a CNC machining center equipped with the tombstone-type fixture. The time required for machining, tool traveling and tool changing is taken into consideration under relevant constraints such as precedence, fixture and available cutting tools. The optimal process plan can be obtained from the mathematical model and it is considered practical and acceptable.

Abstract: A Two-level method is proposed to solve the one-dimensional cutting-stock problem during the production process in this paper. First, nested layer cycle is designed to enumerate all the feasible cutting patterns, then a integer linear programming model is established with quantity demands as the constraint. The best cutting scheme is obtained finally according to the branch and bound method. The effectiveness of the proposed method is proved through a real world example, the calculations demonstrate that scheme obviously improves the utilization rate of stock

Abstract: Project portfolio selection involves decision making and it plays a crucial role in any organization. Therefore selecting not just the right projects but also the right mix of projects for the portfolio is considered as one of the most important tasks for organisations to ensure the achievement of the corporate strategy within limited resources and capabilities of the organization. Prioritizing and selecting optimal project portfolio can be very challenging especially with a large number of projects with multiple constraints and interdependences. In an ideal world with unlimited budget the project selection process would be very straightforward. However, this is not the case in life situations. In this work, an attempt is made to address this challenge. An integer linear programming model for project selection was developed and applied in a selected organization in Nigeria. The model seeks to optimize the mix of the projects to be undertaken while keeping the total cost and project interdependency as constraints. The analysis of the results showed that a total of 11 projects out of 16 were eligible for selection in the period under review. The total cost of the selected project was 92,840,000 Naira, which was about 90% of the total budget. Ordinarily, apart from not prioritizing and obtaining an optimal project mix, the community would have spread its entire resources on the 16 projects with some of them being abandoned later. The model can also be used to plan an optimal mix of project portfolio for a future date within the limitations of a given set of constraints and interdependence.