Access Restriction

Author Bruno, John L.
Source ACM Digital Library
Content type Text
Publisher Association for Computing Machinery (ACM)
File Format PDF
Copyright Year ©1976
Language English
Subject Domain (in DDC) Computer science, information & general works ♦ Data processing & computer science
Abstract A sequencing problem wherein there is a single processor and a finite number of jobs needing service is considered. Each job consists of a sequence of tasks generated probabilistically by a finite state Markov chain. Each state in the Markov chain is identified with a task and has a service-time requirement and a deferral cost, both of which are random variables. The goal is to minimize the expected value of the sum of the weighted finishing times of all the tasks. The sequencing discipline is nonpreemptive. It is shown that there exists an optimal priority sequencing rule based on a rank defined for each task; an efficient algorithm for calculating the rank is given.
ISSN 00045411
Age Range 18 to 22 years ♦ above 22 year
Educational Use Research
Education Level UG and PG
Learning Resource Type Article
Publisher Date 1976-10-01
Publisher Place New York
e-ISSN 1557735X
Journal Journal of the ACM (JACM)
Volume Number 23
Issue Number 4
Page Count 10
Starting Page 655
Ending Page 664

Open content in new tab

   Open content in new tab
Source: ACM Digital Library