The explicit analysis of polling systems combined with non-preemptive priority scheduling under self-similar traffic input

Di perusahaan pakaian, jadwal produksi ditentukan secara periodik. Seringkali suatu jadwal yang telah ditentukan harus diubah secara tiba-tiba akibat permintaan pasar dan hal-hal lain yang bersifat penting secara pemasaran. Perubahan jadwal produksi harus diperhitungkan secara cermat, atau akan menyebabkan berkurangnya keuntungan potensial perusahaan. Perubahan jadwal produksi harus didasarkan pada perhitungan nilai prioritas yang baik. Penelitian ini mengungkapkan faktor-faktor penentu nilai prioritas produksi pakaian, yaitu: keuntungan potensial (K), tenggat waktu (Td), lama produksi (Tp), strategi marketing (m). Rumusan antara faktor-faktor tersebut juga telah berhasil dinyatakan secara jelas, yaitu: P = (K ∙ m) / (Td ∙ Tp). Penelitian ini juga merumuskan suatu metode penjadwalan produksi pakaian, Quantum-based dan Preemptive Priority Scheduling (QPPS) yang merupakan penggabungan dua algoritma penjadwalan task di sistem operasi, yaitu algoritma quantum-based round-robin dan preemptive priority scheduling. Berdasarkan model kasus pada penelitian ini, penggunaan perhitungan nilai prioritas dan strategi penjadwalan produksi pakaian metode QPPS berhasil meningkatkan keuntungan potensial sebesar 13,1 % dibandingkan metode konvensional.

Download Full-text

A semi-preemptive priority scheduling discipline: Performance analysis

European Journal of Operational Research ◽

10.1016/j.ejor.2012.08.008 ◽

2013 ◽

Vol 224 (2) ◽

pp. 324-332 ◽

Cited By ~ 6

Author(s):

Joris Walraevens ◽

Tom Maertens ◽

Herwig Bruneel

Keyword(s):

Performance Analysis ◽

Preemptive Priority ◽

Priority Scheduling

Download Full-text

Analysis of a finite buffer with non-preemptive priority scheduling

Communications in Statistics Stochastic Models ◽

10.1080/15326349908807539 ◽

1999 ◽

Vol 15 (2) ◽

pp. 345-365 ◽

Cited By ~ 8

Author(s):

Dietmar Wagner ◽

Udo R. Krieger

Keyword(s):

Finite Buffer ◽

Preemptive Priority ◽

Priority Scheduling

Download Full-text

A GPU Kernel Transactionization Scheme for Preemptive Priority Scheduling

2018 IEEE Real-Time and Embedded Technology and Applications Symposium (RTAS) ◽

10.1109/rtas.2018.00029 ◽

2018 ◽

Cited By ~ 1

Author(s):

Hyeonsu Lee ◽

Jaehun Roh ◽

Euiseong Seo

Keyword(s):

Preemptive Priority ◽

Priority Scheduling

Download Full-text

An Improved Queuing Model for Reducing Average Waiting Time of Emergency Surgical Patients Using Preemptive Priority Scheduling

International Journal of Emerging Trends in Engineering Research ◽

10.30534/ijeter/2021/32962021 ◽

2021 ◽

Vol 9 (6) ◽

pp. 827-840

Keyword(s):

Waiting Time ◽

Time Management ◽

Arrival Rate ◽

Preemptive Priority ◽

Queuing Model ◽

Priority Scheduling ◽

Average Waiting Time ◽

Public Sector Hospital ◽

Medical Facilities ◽

The Mean

Our research objective is to reduce the Average Waiting Time for patients in an Emergency Department of public sector hospital. We have based our model on M/M/s Queuing System, our study revealssignificant findings on arrival rate of patients. During this simulation, we have used a preemptive priority scheduling model. In our practice, the arrival rate followed a Poisson distribution, averaging 30 patients per hour, with the Mean Service time of1.5 hours and Average Waiting Time recorded around 12.13 minutes. This research offersvaluable help to achieve better time management in emergency departments of high-density medical facilities.

Download Full-text