| dc.contributor.author | Agola, Joshua | |
| dc.contributor.author | Raburu, George | |
| dc.date.accessioned | 2020-02-26T15:50:58Z | |
| dc.date.available | 2020-02-26T15:50:58Z | |
| dc.date.issued | 2018-05-17 | |
| dc.identifier.issn | 2320-9364 | |
| dc.identifier.issn | 2320-9356 | |
| dc.identifier.uri | http://ir.jooust.ac.ke:8080/xmlui/handle/123456789/8678 | |
| dc.description.abstract | Scheduling in computing is the rearrangement of machine instructions to obtain the optimal level
services subject to various constraints. The scheduling activity is controlled by a scheduler (part of the Operating Systems that initiates and stops the computer programs). This study proposes a dynamic scheduling optimization model (DSOM) that handles unexpected machine breakages and balances the workload amongst the available machines at optimal time and make span. The model mimics the multiprocessor scheduling theory that is formulated as a blocking parallel-machine job shop scheduling (BPMJSS) problem. In the developed model, any unexpected machine failure during load balancing is detectable and available machines are considered for | en_US |
| dc.language.iso | en | en_US |
| dc.publisher | International Journal of Research in Engineering and Science (IJRES) | en_US |
| dc.subject | Dynamic, Static, Load balancing, Shifting bottleneck algorithm, shortest processing time algorithm. | en_US |
| dc.title | A Dynamic Scheduling Optimization Model (DSOM) | en_US |
| dc.type | Article | en_US |