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
On the minimization of total weighted flow time with identical and uniform parallel machines
Date
1999-02-16
Author
Azizoğlu, Meral
Kirca, O
Metadata
Show full item record
This work is licensed under a
Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License
.
Item Usage Stats
3
views
0
downloads
We consider the NP-hard problem of scheduling jobs on identical parallel machines to minimize total weighted flow time. We discuss the properties that characterize the structure of an optimal solution, present a lower bound and propose a branch and bound algorithm. The algorithm is superior to prior methods presented in the literature. We also extend the algorithm to uniform parallel machines and solve medium-sized problem instances.
Subject Keywords
Branch and bound
,
Parallel machines
,
Scheduling
URI
https://hdl.handle.net/11511/41915
Journal
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
DOI
https://doi.org/10.1016/s0377-2217(97)00427-x
Collections
Department of Industrial Engineering, Article