IN PRESS                   Back to the articles list | Back to browse issues page


XML Print


1- Faculty of Industrial Technology, Institut Teknologi Bandung, Jl. Ganesha No. 10, Bandung 40132, Indonesia
2- Faculty of Industrial Technology, Institut Teknologi Bandung, Jl. Ganesha No. 10, Bandung 40132, Indonesia , sukoyo@itb.ac.id
Abstract:   (27 Views)
This study integrates pickup, production, and batch delivery activities within a make-to-order production system. It distinguishes between holding costs for parts, work-in-process, and finished goods borne by either the manufacturer or the customer to meet the demands of a single customer with varying due dates. The problem is formulated as a Mixed-Integer Nonlinear Programming model that simultaneously determines the number of batches, batch sizes, and schedules for all three activities; a backward scheduling approach is employed to minimize total relevant costs based on the Actual Flow Time (AFT) metric. Decisions regarding batch quantity, size, and production scheduling both influence and are influenced by decisions concerning delivery and pickup activities. Due to the complexity of the model and the inclusion of continuous, binary, and integer decision variables, an analytical solution is not feasible; consequently, an exact method using the Gurobi solver was applied. With a computation time limit of 10.800 seconds, Gurobi failed to find an optimal solution, identifying only the best feasible solution for the five tested datasets; therefore, a Genetic Algorithm (GA) was developed. The proposed GA is capable of solving the problem and generating solutions that approximate the best feasible solutions found by the exact method, while requiring significantly less computation time.

 
Full-Text [PDF 722 kb]   (14 Downloads)    
Type of Study: Research | Subject: Production Planning & Control
Received: 2026/09/14 | Accepted: 2026/10/4

Add your comments about this article : Your username or Email:
CAPTCHA

Send email to the article author


Rights and permissions
Creative Commons License This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.