<?xml version="1.0" encoding="UTF-8"?><xml><records><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Burnetas, AN</style></author><author><style face="normal" font="default" size="100%">Katehakis, M.N.</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">On sequencing two types of tasks on a single processor under incomplete information</style></title><secondary-title><style face="normal" font="default" size="100%">Probability in the Engineering and Informational Sciences</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">1993</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">https://www.scopus.com/inward/record.uri?eid=2-s2.0-84976024933&amp;doi=10.1017%2fS0269964800002801&amp;partnerID=40&amp;md5=f9a9c0641550ca4694c63fc633358bdb</style></url></web-urls></urls><number><style face="normal" font="default" size="100%">1</style></number><volume><style face="normal" font="default" size="100%">7</style></volume><pages><style face="normal" font="default" size="100%">85-119</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">Two types of tasks are to be scheduled on a single processor under incomplete information about the task lengths. We derive the structure of optimal scheduling rules w.r.t. flowtime, as well as asymptotic approximations for a large number of tasks, when the length distributions belong to a one-parameter exponential family. © 1993, Cambridge University Press. All rights reserved.</style></abstract><notes><style face="normal" font="default" size="100%">cited By 1</style></notes></record></records></xml>