Minimizing the sum of weighted completion times of n‐independent jobs when resource availability varies over time: Performance of a simple priority rule

Julius Surkis and Ali Dogramaci

Naval Research Logistics (NRL), 1988, vol. 35, issue 1, 35-47

Abstract: In this article our objective is to evaluate the performance of a WSPT (weighted shortest processing time) rule for scheduling n independent jobs where the resources to process these jobs vary over time and a job can be processed by several processors simultaneously. This problem was raised by Baker and Nuttle [2]. A linear‐programming (LP) model is formulated to obtain a lower bound on the minimum value of the weighted completion times. The purpose of the model is to provide a basis for evaluating the WSPT heuristic. 1000 experiments were performed using different resource profiles to test the performance of WSPT. Using WSPT, the weighted completion times were found to be, on the average, 0.2% away from their LP lower bounds.

Date: 1988
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
https://doi.org/10.1002/1520-6750(198802)35:13.0.CO;2-3

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:wly:navres:v:35:y:1988:i:1:p:35-47

Access Statistics for this article

More articles in Naval Research Logistics (NRL) from John Wiley & Sons
Bibliographic data for series maintained by Wiley Content Delivery ().