*BSD News Article 34851


Return to BSD News archive

Newsgroups: comp.unix.bsd
Path: sserve!newshost.anu.edu.au!munnari.oz.au!ihnp4.ucsd.edu!dog.ee.lbl.gov!agate!howland.reston.ans.net!vixen.cso.uiuc.edu!news.uoregon.edu!netnews.nwnet.net!ns1.nodak.edu!plains.NoDak.edu!tinguely
From: tinguely@plains.NoDak.edu (Mark Tinguely)
Subject: Re: Reordering Printer Queue ???
Sender: usenet@ns1.nodak.edu (Usenet login)
Message-ID: <CuzznK.KpH@ns1.nodak.edu>
Date: Tue, 23 Aug 1994 17:09:20 GMT
References: <3353or$320@usenet.INS.CWRU.Edu>
Nntp-Posting-Host: plains.nodak.edu
Organization: North Dakota State University
Lines: 17

In article <3353or$320@usenet.INS.CWRU.Edu> cd874@cleveland.Freenet.Edu (Andreas Priebe) writes:
>
>Hallo,
> 
>can anybody tell me if there is a ROBUST possibility in the BSD printer
>spooling system to achieve that the printer queue is reorderd according
>to every new request arriving, so that large
>jobs are printed after short ones (at least mostly).

take a look at lpr/lpq/lpd replacement package named PLP Portable Line Printer
Spooler). This package has printing classes. PLP originally written by
Patrick Powell of U. of Minnesota, though a new release has been recently
announced at:

	ftp.iona.ie:/pub/plp/plp-lpd-3.3.0beta.tar.gz

--mark.