Single Item Batch-scheduling Model for a Flow Shop with m Batch-processing Machines to Minimize Total Actual Flow Time
We propose a batch-scheduling model to minimize the total actual flow time (TAF) of parts to be processed in a flow shop consisting of m batch-processing machines. A batch-processing machine (BPM) is a machine that can process several parts at once, and the TAF of parts is the...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Universitas Indonesia
2022-10-01
|
| Series: | International Journal of Technology |
| Subjects: | |
| Online Access: | https://ijtech.eng.ui.ac.id/article/view/4869 |
| _version_ | 1797963550995513344 |
|---|---|
| author | Abdul Hakim Halim Nita Puspita Anugrawati Hidayat Wisnu Aribowo |
| author_facet | Abdul Hakim Halim Nita Puspita Anugrawati Hidayat Wisnu Aribowo |
| author_sort | Abdul Hakim Halim |
| collection | DOAJ |
| description | We
propose a batch-scheduling model to minimize the total actual flow time (TAF) of parts to be processed in
a flow shop consisting of m batch-processing machines. A
batch-processing machine (BPM) is a machine that can process several parts at
once, and the TAF of parts is the total interval time from the arrival
times to the corresponding due date. In the real world, shop floors often have
production lines with BPMs and multistage processes. We were motivated
by a real problem in the aircraft industry and aimed to simultaneously satisfy
the due dates and minimize the total time that parts spend in the shop. The
problem was formulated as a mathematical model and solved using a proposed
algorithm. The batch-scheduling problem is divided into batching and scheduling
subproblems. The solution has been obtained by adopting backward scheduling. This paper develops a new model of
flow shop scheduling problem for the shop with batch processing machines and
the heuristic solution method. It provides numerical examples and their results
to demonstrate the effectiveness of the proposed algorithm for solving the
problem. |
| first_indexed | 2024-04-11T01:31:10Z |
| format | Article |
| id | doaj.art-1c8d5fb1c12642b1a7a203308d3ba583 |
| institution | Directory Open Access Journal |
| issn | 2086-9614 2087-2100 |
| language | English |
| last_indexed | 2024-04-11T01:31:10Z |
| publishDate | 2022-10-01 |
| publisher | Universitas Indonesia |
| record_format | Article |
| series | International Journal of Technology |
| spelling | doaj.art-1c8d5fb1c12642b1a7a203308d3ba5832023-01-03T09:39:25ZengUniversitas IndonesiaInternational Journal of Technology2086-96142087-21002022-10-0113481682610.14716/ijtech.v13i4.48694869Single Item Batch-scheduling Model for a Flow Shop with m Batch-processing Machines to Minimize Total Actual Flow TimeAbdul Hakim Halim0Nita Puspita Anugrawati Hidayat1Wisnu Aribowo2Department of Industrial Engineering, Bandung Institute of Technology, Jl. Ganesa 10 Bandung 40132, IndonesiaDepartment of Industrial Engineering, Bandung Islamic University, Jl. Tamansari no.1 Bandung 40132, IndonesiaDepartment of Industrial Engineering, Bandung Institute of Technology, Jl. Ganesa 10 Bandung 40132, IndonesiaWe propose a batch-scheduling model to minimize the total actual flow time (TAF) of parts to be processed in a flow shop consisting of m batch-processing machines. A batch-processing machine (BPM) is a machine that can process several parts at once, and the TAF of parts is the total interval time from the arrival times to the corresponding due date. In the real world, shop floors often have production lines with BPMs and multistage processes. We were motivated by a real problem in the aircraft industry and aimed to simultaneously satisfy the due dates and minimize the total time that parts spend in the shop. The problem was formulated as a mathematical model and solved using a proposed algorithm. The batch-scheduling problem is divided into batching and scheduling subproblems. The solution has been obtained by adopting backward scheduling. This paper develops a new model of flow shop scheduling problem for the shop with batch processing machines and the heuristic solution method. It provides numerical examples and their results to demonstrate the effectiveness of the proposed algorithm for solving the problem. https://ijtech.eng.ui.ac.id/article/view/4869batch processorbatch schedulingflow shoptotal actual flow time |
| spellingShingle | Abdul Hakim Halim Nita Puspita Anugrawati Hidayat Wisnu Aribowo Single Item Batch-scheduling Model for a Flow Shop with m Batch-processing Machines to Minimize Total Actual Flow Time International Journal of Technology batch processor batch scheduling flow shop total actual flow time |
| title | Single Item Batch-scheduling Model for a Flow Shop with m Batch-processing Machines to Minimize Total Actual Flow Time |
| title_full | Single Item Batch-scheduling Model for a Flow Shop with m Batch-processing Machines to Minimize Total Actual Flow Time |
| title_fullStr | Single Item Batch-scheduling Model for a Flow Shop with m Batch-processing Machines to Minimize Total Actual Flow Time |
| title_full_unstemmed | Single Item Batch-scheduling Model for a Flow Shop with m Batch-processing Machines to Minimize Total Actual Flow Time |
| title_short | Single Item Batch-scheduling Model for a Flow Shop with m Batch-processing Machines to Minimize Total Actual Flow Time |
| title_sort | single item batch scheduling model for a flow shop with m batch processing machines to minimize total actual flow time |
| topic | batch processor batch scheduling flow shop total actual flow time |
| url | https://ijtech.eng.ui.ac.id/article/view/4869 |
| work_keys_str_mv | AT abdulhakimhalim singleitembatchschedulingmodelforaflowshopwithmbatchprocessingmachinestominimizetotalactualflowtime AT nitapuspitaanugrawatihidayat singleitembatchschedulingmodelforaflowshopwithmbatchprocessingmachinestominimizetotalactualflowtime AT wisnuaribowo singleitembatchschedulingmodelforaflowshopwithmbatchprocessingmachinestominimizetotalactualflowtime |