Re: greedy method

From: David Kastrup (dak_at_gnu.org)
Date: 02/23/05 

Date: Wed, 23 Feb 2005 14:31:00 +0100

"santosh" <santoshvarma@gmail.com> writes:

> Hello all
> I want to know whether there is any greedy approach for job sequencing
> with variable job completion times..
> if there is no greedy approach how to prove it...

Well, one of the best batch scheduling strategies with regard to
several criteria is "shortest remaining processing time first".
Operating systems don't use it much in practice since few jobs
volunteer the information in advance. 

-- 
David Kastrup, Kriemhildstr. 15, 44793 Bochum

Relevant Pages

  • Re: greedy method
    ... > I want to know whether there is any greedy approach for job sequencing ... > with variable job completion times.. ... > if there is no greedy approach how to prove it... ...
    (comp.lang.java.help)
  • Re: greedy method
    ... > I want to know whether there is any greedy approach for job sequencing ... > with variable job completion times.. ... > if there is no greedy approach how to prove it... ...
    (comp.lang.cpp)
  • Re: greedy method
    ... > I want to know whether there is any greedy approach for job sequencing ... > with variable job completion times.. ... > if there is no greedy approach how to prove it... ...
    (sci.math)
  • Re: greedy method
    ... > I want to know whether there is any greedy approach for job sequencing ... > with variable job completion times.. ... > if there is no greedy approach how to prove it... ...
    (comp.programming)
  • Re: greedy method
    ... > I want to know whether there is any greedy approach for job sequencing ... > with variable job completion times.. ... > if there is no greedy approach how to prove it... ...
    (comp.lang.c)