Please use this identifier to cite or link to this item:
https://elibrary.tucl.edu.np/handle/123456789/6610
Title: | Evaluating Heuristic Solutionsfor NP-Hard Single Machine Scheduling Problems |
Authors: | Regmi, Nischal |
Keywords: | Machine Environment;Heuristic Solutions |
Issue Date: | 2008 |
Institute Name: | Central Department of Computer Science and Information Technology |
Level: | Masters |
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. |
URI: | https://elibrary.tucl.edu.np/handle/123456789/6610 |
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.