Show/Hide Menu
Hide/Show Apps
anonymousUser
Logout
Türkçe
Türkçe
Search
Search
Login
Login
OpenMETU
OpenMETU
About
About
Açık Bilim Politikası
Açık Bilim Politikası
Frequently Asked Questions
Frequently Asked Questions
Browse
Browse
By Issue Date
By Issue Date
Authors
Authors
Titles
Titles
Subjects
Subjects
Communities & Collections
Communities & Collections
Fixed job scheduling on uniform parallel machines
Download
143204.pdf
Date
2003
Author
Bekki, Özgün Barış
Metadata
Show full item record
Item Usage Stats
5
views
1
downloads
In this study, a fixed job scheduling problem on uniform parallel machines is considered. The objective function is the maximization of the total weight of the jobs processed. We show that it is NP-hard and develop polynomial time algo rithms for some special cases. We propose a branch and bound algorithm that employs dominance conditions and powerful lower and upper bounding proce dures. Computational analysis is conducted to investigate the effects of changing certain parameters on the difficulty of the problem. The results have revealed that the algorithm finds solutions to large sized problem instances in reasonable times.
Subject Keywords
Fixed job scheduling
,
Uniform machines
,
Total weight
URI
https://hdl.handle.net/11511/13603
Collections
Graduate School of Natural and Applied Sciences, Thesis