Please use this identifier to cite or link to this item:
https://elibrary.tucl.edu.np/handle/123456789/6610
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Regmi, Nischal | - |
dc.date.accessioned | 2021-12-23T04:24:30Z | - |
dc.date.available | 2021-12-23T04:24:30Z | - |
dc.date.issued | 2008 | - |
dc.identifier.uri | https://elibrary.tucl.edu.np/handle/123456789/6610 | - |
dc.description.abstract | Scheduling, though being a classical problem of computer science, is still anevolving area of research. Unfortunately, many scheduling problems havinghigh practical significance belong to the classNP-hard, or in simple words, theyare not solved exactly by any efficient algorithm on any computer. In thisdissertation, scheduling problems for the case of single machine problem isstudied. The schemes of evaluating near-to-exact solutions for NP-hardproblems are examined, and an algorithm based on tabu search is devised for the single machine scheduling problem 1 | rj |Cj , where jobs arrive over time,preemption is not allowed, and the objective is to minimize the total completiontime. | en_US |
dc.language.iso | en_US | en_US |
dc.subject | Machine Environment | en_US |
dc.subject | Heuristic Solutions | en_US |
dc.title | Evaluating Heuristic Solutionsfor NP-Hard Single Machine Scheduling Problems | en_US |
dc.type | Thesis | en_US |
local.institute.title | Central Department of Computer Science and Information Technology | en_US |
local.academic.level | Masters | en_US |
Appears in Collections: | Computer Science & Information Technology |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
COVER.pdf | 80.15 kB | Adobe PDF | View/Open | |
CHAPTER.pdf | 466.49 kB | Adobe PDF | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.