On Sequencing Two Types of Tasks on a Single Processor under Incomplete Information

1993/01/01 by Apostolos Burnetas, Michael N. Katehakis · 3 citations
Computer Science · Decision Sciences · #Advanced Bandit Algorithms Research #Optimization and Search Problems #Reinforcement Learning in Robotics

paper · doi:10.1017/s0269964800002801

openalex publication_date 1993/01/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/06/26

Abstract

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.

Citations

• On Information and Sufficiency

Cited by

• Optimal Adaptive Policies for Sequential Allocation Problems
• Normal Bandits of Unknown Means and Variances: Asymptotic Optimality, Finite Horizon Regret Bounds, and a Solution to an Open Problem
• Michael Katehakis [wikipedia]