IMPROVEMENT OF FLOW SHOP PRODUCTION SCHEDULING TO MINIMIZE MAKESPAN
PT ACP is a company where located in Gunung Putri, Bogor. PT ACP provides cooking or kitchen equipment manufacturing company with main product such as stove, cabinet, and oven products. PT ACP's production type is flow shop type and PT ACP's order fulfillment method is a make-to-order syst...
Saved in:
Main Author: | |
---|---|
Format: | Final Project |
Language: | Indonesia |
Online Access: | https://digilib.itb.ac.id/gdl/view/79335 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Institut Teknologi Bandung |
Language: | Indonesia |
id |
id-itb.:79335 |
---|---|
spelling |
id-itb.:793352023-12-22T17:43:48ZIMPROVEMENT OF FLOW SHOP PRODUCTION SCHEDULING TO MINIMIZE MAKESPAN Chandra Sandjaya Putra, Firza Indonesia Final Project Production scheduling, makespan, overtime, sequencing rules. INSTITUT TEKNOLOGI BANDUNG https://digilib.itb.ac.id/gdl/view/79335 PT ACP is a company where located in Gunung Putri, Bogor. PT ACP provides cooking or kitchen equipment manufacturing company with main product such as stove, cabinet, and oven products. PT ACP's production type is flow shop type and PT ACP's order fulfillment method is a make-to-order system. The work stations at PT ACP in general are cutting work stations with laser machines, deburring, bending, welding, polishing, to finishing. PT ACP often holds overtime in fulfilling customer orders due to lack of planning so they have to work overtime on weekends on non-working days. This is due to the irregular production scheduling process of PT ACP by using workmanship principles that are not in accordance with the company's needs. Thus, this study aims to find the best scheduling method for PT ACP with the criteria of minimizing the total makespan. The design of the proposed improvement is carried out by making a production schedule for PT ACP using the Campbell Dudek Smith (CDS) algorithm, the Nawaz-Encore-Ham (NEH) algorithm, the Palmer algorithm, and the Dannenbring algorithm for historical data from customers of Tan Ramen Bandung, Shu Go Go PIK, and Laguna Fat Boba Surabaya. Based on scheduling results, the total makespan value of Tan Tan Ramen customers is 9182 minutes from NEH which is better than the actual schedule results. To be compared with Shu Go Go PIK, the NEH algorithm also obtains the smallest actual pan with a value of 4394 minutes which is 414 minutes faster in actual conditions. And the request for Fat Boba Surabaya Lagoon, makes the smallest pan also obtained by the NEH algorithm with a value of 1779 minutes which is 143 minutes faster than the actual condition. After being selected as the best scheduler, a scheduling program was created using the Python program to automate scheduling at PT ACP using the NEH method. The existence of this production scheduling is expected to accelerate the fulfillment of customer orders and minimize overtime time to fulfill orders by PT ACP. text |
institution |
Institut Teknologi Bandung |
building |
Institut Teknologi Bandung Library |
continent |
Asia |
country |
Indonesia Indonesia |
content_provider |
Institut Teknologi Bandung |
collection |
Digital ITB |
language |
Indonesia |
description |
PT ACP is a company where located in Gunung Putri, Bogor. PT ACP provides cooking or kitchen equipment manufacturing company with main product such as stove, cabinet, and oven products. PT ACP's production type is flow shop type and PT ACP's order fulfillment method is a make-to-order system. The work stations at PT ACP in general are cutting work stations with laser machines, deburring, bending, welding, polishing, to finishing.
PT ACP often holds overtime in fulfilling customer orders due to lack of planning so they have to work overtime on weekends on non-working days. This is due to the irregular production scheduling process of PT ACP by using workmanship principles that are not in accordance with the company's needs. Thus, this study aims to find the best scheduling method for PT ACP with the criteria of minimizing the total makespan.
The design of the proposed improvement is carried out by making a production schedule for PT ACP using the Campbell Dudek Smith (CDS) algorithm, the Nawaz-Encore-Ham (NEH) algorithm, the Palmer algorithm, and the Dannenbring algorithm for historical data from customers of Tan Ramen Bandung, Shu Go Go PIK, and Laguna Fat Boba Surabaya. Based on scheduling results, the total makespan value of Tan Tan Ramen customers is 9182 minutes from NEH which is better than the actual schedule results. To be compared with Shu Go Go PIK, the NEH algorithm also obtains the smallest actual pan with a value of 4394 minutes which is 414 minutes faster in actual conditions. And the request for Fat Boba Surabaya Lagoon, makes the smallest pan also obtained by the NEH algorithm with a value of 1779 minutes which is 143 minutes faster than the actual condition. After being selected as the best scheduler, a scheduling program was created using the Python program to automate scheduling at PT ACP using the NEH method. The existence of this production scheduling is expected to accelerate the fulfillment of customer orders and minimize overtime time to fulfill orders by PT ACP. |
format |
Final Project |
author |
Chandra Sandjaya Putra, Firza |
spellingShingle |
Chandra Sandjaya Putra, Firza IMPROVEMENT OF FLOW SHOP PRODUCTION SCHEDULING TO MINIMIZE MAKESPAN |
author_facet |
Chandra Sandjaya Putra, Firza |
author_sort |
Chandra Sandjaya Putra, Firza |
title |
IMPROVEMENT OF FLOW SHOP PRODUCTION SCHEDULING TO MINIMIZE MAKESPAN |
title_short |
IMPROVEMENT OF FLOW SHOP PRODUCTION SCHEDULING TO MINIMIZE MAKESPAN |
title_full |
IMPROVEMENT OF FLOW SHOP PRODUCTION SCHEDULING TO MINIMIZE MAKESPAN |
title_fullStr |
IMPROVEMENT OF FLOW SHOP PRODUCTION SCHEDULING TO MINIMIZE MAKESPAN |
title_full_unstemmed |
IMPROVEMENT OF FLOW SHOP PRODUCTION SCHEDULING TO MINIMIZE MAKESPAN |
title_sort |
improvement of flow shop production scheduling to minimize makespan |
url |
https://digilib.itb.ac.id/gdl/view/79335 |
_version_ |
1822008850745655296 |