A (Small) Complexity Performance Contest: SPT versus LBFS

Erland Hejn Nielsen ()
Additional contact information
Erland Hejn Nielsen: Department of Management Science and Logistics, Aarhus School of Business, Postal: Fuglesangs Allé 4, 8210 Aarhus V, Denmark, http://www.asb.dk/EOK/IDL/STAFF/EHN_FORM.HTM

No 02-2, Working Papers from University of Aarhus, Aarhus School of Business, Department of Management Science and Logistics

Keywords: Queuing theory; Logistics; Shortest processing time; Last buffer first served (search for similar items in EconPapers)
Pages: 11 pages
Date: 2002-05-08
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

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:hhb:aarmsl:2002_002

Access Statistics for this paper

More papers in Working Papers from University of Aarhus, Aarhus School of Business, Department of Management Science and Logistics The Aarhus School of Business, Fuglesangs Allé 4, DK-8210 Aarhus V, Denmark. Contact information at EDIRC.
Bibliographic data for series maintained by Helle Vinbaek Stenholt ( this e-mail address is bad, please contact ).