Batch-scheduling problems to minimize actual flow times of parts through the shop under JIT environment

Halim, Abdul Hakim; Miyazaki, Shigeji; Ohta, Hiroshi

doi:10.1016/0377-2217(94)90421-9

Cited by 23 publications

(35 citation statements)

References 4 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…STUDI LITERATUR Waktu tinggal aktual merupakan lamanya suatu job berada di lantai produksi dari saat job mulai diproses sampai saat job tersebut dikirim pada due date nya [9]. Jika terdapat sejumlah job (n) yang diminta pada due date yag sama(d) dengan waktu proses job adalah p, saat mulai pemrosesan job i adalah Bi, dan waktu set up mesin adalah s dan diasumsikan besarnya waktu set up tidak dipengaruhi oleh urutan pemrosesan job, sehingga waktu tinggal aktual diberikan oleh persamaan:…”

Section: IIunclassified

Model Penjadwalan Pada Batch Processor Tunggal Dengan Waktu Proses Yang Tidak Konstan Untuk Meminimasi Total Waktu Tinggal Aktual

Astuti

Halim

2017

JRSI

Self Cite

View full text Add to dashboard Cite

Abstrak-Penjadwalan batch sudah didiskusikan di beberapa penelitian. Terdapat dua jenis penjadwalan batch yaitu job processor dan batch processor. Pada job processor, part diproses secara bergantian sampai semua part dalam satu batch selesai diproses, sedangkan pada batch processor part diproses bersama dalam satu waktu sehingga waktu untuk memproses batch besarnya sama dengan waktu untuk memproses satu part. Berbeda dengan penelitian sebelumnya, pada penelitian ini waktu untuk memproses batch bukan hanya waktu untuk memproses satu part namun gabungan dari waktu yang diperlukan untuk memproses satu part dan waktu untuk memasang tools pada setiap part dalam satu batch. Penelitian ini merupakan tahap ke dua, setelah sebelumnya dikembangkan model yang sama namun untuk masalah single item dengan due date yang sama maka pada penelitian ini due date dari item berbeda -beda. Model penjadwalan untuk masalah multi due date diselesaikan dengan menganggap satu interval waktu yang merupakan selisih antar dua due date yang berurutan sebagai masalah common due date. Jumlah minimum batch yang terbentuk untuk setiap interval waktu ini adalah satu dan waktu minimal untuk memproses batch besarnya sama dengan waktu untuk memproses satu part ditambah dengan waktu yang diperlukan untuk memasang tools untuk seluruh part pada satu batch. Jika waktu pada interval waktu tidak cukup untuk memproses part yang diminta pada interval waktu tersebut maka part diproses pada interval waktu setelahnya. Model diuji dengan beberapa set data hipotetik. Variabel keputusan adalah jumlah batch dan ukuran batch untuk setiap interval waktu, dan urutan pengerjaan batch sehingga akan meminimasi total waktu tinggal aktual.Kata kunci: batch, batch processor, single item, common due date, multi due date, waktu tinggal aktual Abstract-Batch scheduling has been discussed in several studies. There are two types of batch scheduling, job processor and batch processor. On job processor, parts are processed alternately until all parts are processed, while in batch processor parts in batch are processed together in one time. Hence the processing time for batches is equal to one part processing time. Unlike the previous study, in this study batch processing time not only time to process one part but it is the sum of processing time of one part and time to install tools on each part in one batch. This paper is continuation of previously developed batch scheduling model for single item common due date problem, hence for multi due date.The scheduling model for single item multi due date is solved by considering one time interval which is the difference between two successive due dates as a common due date issue. The minimum number of batches generated for each time interval is one and the minimum time required to process this batch is the one-part processing time plus the time required to install tools on all parts in one batch. If the time at the time interval is not sufficient to process the requested part at that time interval then the part is processed at the time i...

show abstract

Section: IIunclassified

Model Penjadwalan Pada Batch Processor Tunggal Dengan Waktu Proses Yang Tidak Konstan Untuk Meminimasi Total Waktu Tinggal Aktual

Astuti

Halim

2017

JRSI

Self Cite

View full text Add to dashboard Cite

show abstract

“…Therefore, the AFT of each part in a batch is the same as the AFT of the batch. Thus, the AFT of total parts in batch can be calculated by multiplying the AFT of the batch by the number of parts in the batch, [14]. Hence, the AFT, ( ) , of the parts in batch is formulated as follows:…”

Section: Actual Flow Time Of Production and Delivery Batch Schedulingmentioning

confidence: 99%

“…AFT performance applied at the production stage regardless of transportation time has been proposed in [14]. The AFT of a batch, ( , is defined by [14] as the time the batch spends in the shop from the starting time of its processing, , until its due date, .…”

Section: Actual Flow Time Of Production and Delivery Batch Schedulingmentioning

confidence: 99%

“…The AFT of a batch, ( , is defined by [14] as the time the batch spends in the shop from the starting time of its processing, , until its due date, . The formulation is as follows in Eq.…”

Section: Actual Flow Time Of Production and Delivery Batch Schedulingmentioning

confidence: 99%

“…AFT performance was used, adopting a backward scheduling approach in order to minimize the time of the parts flowing in both stages and meet the due date simultaneously. AFT performance has been applied in [14][15][16] and [17] in various batch scheduling problems at the production stage. A brief description of AFT will be given in Section 3.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Production and Delivery Batch Scheduling with Multiple Due Dates to Minimize Total Cost

Prasetyaningsih

Suprayogi

Samadhi

et al. 2017

J. Eng. Technol. Sci.

Self Cite

View full text Add to dashboard Cite

Abstract. This paper addresses an integrated production and delivery batch scheduling problem for a make-to-order environment over daily time period, where the holding costs of in-process and completed parts at a supplier location and of completed parts at a manufacturer location are distinguished. All orders of parts with different due dates from the manufacturer arrive at the same time. The parts are produced in production batches and subsequently the completed parts are delivered in delivery batches using a capacitated vehicle in order to be received at the respective due dates. This study was aimed at finding an integrated schedule of production and delivery batches so as to meet the due date at minimum total cost consisting of the corresponding holding cost and delivery cost. The holding cost is a derivation of the so-called actual flow time (AFT), while the delivery cost is assumed to be proportional to the number of deliveries. The problems can be formulated as an integer non-linear programming model, and the global optimal solution can be obtained using optimization software. A heuristic algorithm is proposed to cope with the computational time problem using software. The numerical experiences show that the proposed algorithm yields near global optimal solutions.

show abstract

A Batch Scheduling Model for a Three-Stage Flowshop with Batch Processor and Heterogeneous Job Processor to Minimize Total Actual Flowtime

Suryadhini,

Sukoyo,

Suprayogi

et al. 2022

Intelligent Engineering and Management for Industry 4.0

View full text Add to dashboard Cite

Batch-scheduling problems to minimize actual flow times of parts through the shop under JIT environment

Cited by 23 publications

References 4 publications

Model Penjadwalan Pada Batch Processor Tunggal Dengan Waktu Proses Yang Tidak Konstan Untuk Meminimasi Total Waktu Tinggal Aktual

Model Penjadwalan Pada Batch Processor Tunggal Dengan Waktu Proses Yang Tidak Konstan Untuk Meminimasi Total Waktu Tinggal Aktual

Production and Delivery Batch Scheduling with Multiple Due Dates to Minimize Total Cost

A Batch Scheduling Model for a Three-Stage Flowshop with Batch Processor and Heterogeneous Job Processor to Minimize Total Actual Flowtime

Contact Info

Product

Resources

About