Semi-Online Machine Covering under a Grade of Service Provision
Competitive Analysis
Online algorithm
Value (mathematics)
DOI:
10.4028/www.scientific.net/amm.101-102.484
Publication Date:
2011-09-27T12:31:47Z
AUTHORS (3)
ABSTRACT
Two semi-online scheduling problems on two parallel identical machines under a grade of service (GoS) provision were studied. The goal is to maximize the minimum machine load. For version where largest processing time all jobs known in advance, we show that no competitive algorithm exists. optimal offline value propose an with ratio 2.
SUPPLEMENTAL MATERIAL
Coming soon ....
REFERENCES (9)
CITATIONS (0)
EXTERNAL LINKS
PlumX Metrics
RECOMMENDATIONS
FAIR ASSESSMENT
Coming soon ....
JUPYTER LAB
Coming soon ....