MTTDFR-SJFR: A Combinatorial Rule Approach To Balance Tradeoff Between Flowtime, Makespan, Delayed Jobs, Total Tardiness And Utilization
In order to fully utilize the Grid resources, implementing a good scheduling algorithm is really important. Currently, some of the well-known researches and enterprise schedulers have applied Priority Rule (PR) schedulers to manage the Grid jobs because they are simple and easy to implement. To date...
Main Authors: | Zafril Rizal, M Azmi, Imran Edzereiq, Kamarudin, Ngahzaifa, Ab. Ghani |
---|---|
Format: | Article |
Language: | English |
Published: |
Publishing Technology
2018
|
Subjects: | |
Online Access: | http://umpir.ump.edu.my/id/eprint/19604/1/MTTDFR-SJFR%20-%20A%20Combinatorial%20Rule%20Approach%20To%20Balance%20Tradeoff%20Between%20Flowtime%2C%20Makespan%2C%20Delayed%20Jobs%2C%20Total%20Tardiness%20And%20Utilization.pdf |
Similar Items
-
Simulated annealing approach for solving job shop scheduling problem with makespan and total weighted tardiness /
by: Nurul Liyana Abdul Aziz, 1990- author, et al.
Published: (2014) -
Backward simulation and multiple-objective optimization of job shop scheduling with zero tardiness and minimum makespan/
by: 372138 Mejtsky, G. J. -
Combinatorial Rules Approach to Improve Priority Rules Scheduler in Grid Computing Environment
by: Zafril Rizal, M Azmi, et al.
Published: (2012) -
Minimizing makespan and total weighted tardiness for job shop scheduling problem using shifting bottleneck heuristic /
by: 443720 Teoh, Lay Eng
Published: (2005) -
Minimizing makespan and total weighted tardiness for job shop scheduling problem using shifting bottleneck heuristic /
by: 390816 Sutinah Salim, et al.
Published: (2004)