scholarly journals The Exact Analysis of Limited Service Polling Systems Combined with Non-preemptive Priority Scheduling under Self-similar Traffic Input

2013 ◽  
Vol 19 ◽  
pp. 214-223 ◽  
Author(s):  
Mutaz Beraka ◽  
Mohsin Iftikhar ◽  
Hassan Mathkour ◽  
Abdullah Bedaiwi
Keyword(s):  
Polling Systems ◽  
Preemptive Priority ◽  
Priority Scheduling ◽  
Exact Analysis ◽  
Self Similar ◽  
Limited Service

scholarly journals Strategi Penjadwalan Produksi Pakaian Metode Quantum-Based Dan Preemptive Priority Scheduling

2018 ◽  
Vol 4 (2) ◽  
pp. 77-83
Author(s):  
Budiyantoro ◽  
Yusrila Yeka Kerlooza
Keyword(s):  
Round Robin ◽  
Preemptive Priority ◽  
Priority Scheduling

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.

A semi-preemptive priority scheduling discipline: Performance analysis

2013 ◽  
Vol 224 (2) ◽  
pp. 324-332 ◽  
Author(s):  
Joris Walraevens ◽  
Tom Maertens ◽  
Herwig Bruneel
Keyword(s):  
Performance Analysis ◽  
Preemptive Priority ◽  
Priority Scheduling

Comments on "Exact analysis of asymmetric polling systems with single buffers

1990 ◽  
Vol 38 (7) ◽  
pp. 944-946 ◽  
Author(s):  
B. Mukherjee ◽  
C.K. Kwok ◽  
A.C. Lantz ◽  
W.-H.L.M. Moh
Keyword(s):  
Polling Systems ◽  
Exact Analysis

Analysis of finite-capacity polling systems

1991 ◽  
Vol 23 (2) ◽  
pp. 373-387 ◽  
Author(s):  
Hideaki Takagi
Keyword(s):  
Time Distribution ◽  
Arrival Process ◽  
Polling Systems ◽  
Single Server ◽  
Service Time Distribution ◽  
Finite Capacity ◽  
Poisson Arrival ◽  
Finite Capacity Queues ◽  
General Service ◽  
Limited Service

We consider a system of N finite-capacity queues attended by a single server in cyclic order. For each visit by the server to a queue, the service is given continuously until that queue becomes empty (exhaustive service), given continuously only to those customers present at the visiting instant (gated service), or given to only a single customer (limited service). The server then switches to the next queue with a random switchover time, and administers the same type of service there similarly. For such a system where each queue has a Poisson arrival process, general service time distribution, and finite capacity, we find the distribution of the waiting time at each queue by utilizing the known results for a single M/G/1/K queue with multiple vacations.

Analysis of finite-capacity polling systems

1991 ◽  
Vol 23 (02) ◽  
pp. 373-387 ◽  
Author(s):  
Hideaki Takagi
Keyword(s):  
Time Distribution ◽  
Arrival Process ◽  
Polling Systems ◽  
Single Server ◽  
Service Time Distribution ◽  
Finite Capacity ◽  
Poisson Arrival ◽  
Finite Capacity Queues ◽  
General Service ◽  
Limited Service

We consider a system of N finite-capacity queues attended by a single server in cyclic order. For each visit by the server to a queue, the service is given continuously until that queue becomes empty (exhaustive service), given continuously only to those customers present at the visiting instant (gated service), or given to only a single customer (limited service). The server then switches to the next queue with a random switchover time, and administers the same type of service there similarly. For such a system where each queue has a Poisson arrival process, general service time distribution, and finite capacity, we find the distribution of the waiting time at each queue by utilizing the known results for a single M/G/1/K queue with multiple vacations.

Sign in / Sign up

Export Citation Format

Share Document