SPT sequencing with dependent processing times

Hv Ravinder and Cr Schultz

Omega, 1992, vol. 20, issue 3, 391-397

Abstract: This paper investigates the applicability of SPT-based strategies to situations where the processing time for a particular task is not known until some other task has been completed. For comparison a random strategy is used. Two cases are considered: the static case which assumes that all jobs to be processed are present in the shop, and the dynamic case in which jobs arrive randomly over time. The improvement in flow time resulting from the SPT-based strategy is quantified analytically for the static case. For the dynamic case some simulation results are presented. Both sets of results indicate that SPT is a very robust strategy which results in significant reductions in a wide variety of situations.

Keywords: sequencing; shortest; processing; time; mean; flow-time (search for similar items in EconPapers)
Date: 1992
References: Add references at CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/0305-0483(92)90043-7
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:jomega:v:20:y:1992:i:3:p:391-397

Ordering information: This journal article can be ordered from
http://www.elsevier.com/wps/find/supportfaq.cws_home/regional
https://shop.elsevie ... _01_ooc_1&version=01

Access Statistics for this article

Omega is currently edited by B. Lev

More articles in Omega from Elsevier
Bibliographic data for series maintained by Catherine Liu ().