![Parallel machine scheduling under a grade of service provision [An article from: Computers and Operations Research]](https://www.ebooknetworking.net/books/B00/0RR/bigB000RR16ZO.jpg)
Parallel machine scheduling under a grade of service provision [An article from: Computers and Operations Research]
Book Details
Author(s)H.-C. Hwang, S.Y. Chang, K. Lee
PublisherElsevier
ISBN / ASINB000RR16ZO
ISBN-13978B000RR16Z3
AvailabilityAvailable for download now
Sales Rank99,999,999
MarketplaceUnited States 🇺🇸
Description
This digital document is a journal article from Computers and Operations Research, published by Elsevier in 2004. The article is delivered in HTML format and is available in your Amazon.com Media Library immediately after purchase. You can view it with any web browser.
Description:
We consider the problem of scheduling parallel machines that process service requests from various customers who are entitled to many different grade of service (GoS) levels. We propose and analyze one simple way to ensure such differentiated service. In particular, we investigate how the longest processing time first algorithm (LPT) would perform in the worst case and show that a slight modification of LPT could significantly improve its worst-case performance.
Description:
We consider the problem of scheduling parallel machines that process service requests from various customers who are entitled to many different grade of service (GoS) levels. We propose and analyze one simple way to ensure such differentiated service. In particular, we investigate how the longest processing time first algorithm (LPT) would perform in the worst case and show that a slight modification of LPT could significantly improve its worst-case performance.
