«

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...

* santosh:
>

OT.

--
A: Because it messes up the order in which people normally read text.
Q: Why is it such a bad thing?
A: Top-posting.
Q: What is the most annoying thing on usenet and in e-mail?

"santosh" <> 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

* David Kastrup:
>

OT in _four_ of the five groups posted to.

--
A: Because it messes up the order in which people normally read text.
Q: Why is it such a bad thing?
A: Top-posting.
Q: What is the most annoying thing on usenet and in e-mail?

santosh wrote:

> 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...


Perhaps you are looking for PERT diagrams?

http://aisweb.wustl.edu/hr/empld.nsf/pages/pert

http://www.netmba.com/operations/project/pert/




--
Ioannis Vranos

http://www23.brinkster.com/noicys

Ioannis Vranos wrote:

> Perhaps you are looking for PERT diagrams?
>
> http://aisweb.wustl.edu/hr/empld.nsf/pages/pert
>
> http://www.netmba.com/operations/project/pert/


There are also GANT diagrams which involve graphic bars.




--
Ioannis Vranos

http://www23.brinkster.com/noicys

Ioannis Vranos wrote:

> There are also GANT diagrams which involve graphic bars.

GANTT

http://aisweb.wustl.edu/hr/empld.nsf...f?OpenDocument



--
Ioannis Vranos

http://www23.brinkster.com/noicys

David Kastrup wrote:
> "santosh" <> 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

just to add a little sparkling to it - "SORT BY FINISHING TIME and
eliminate overlaps"

David Kastrup wrote:
> "santosh" <> 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

just to add a little sparkling to it - "SORT BY FINISHING TIME and
eliminate overlaps"

"Alf P. Steinbach" wrote:
> * David Kastrup:
>
> OT in _four_ of the five groups posted to.

So do something rather than add to the mess. Set followups and
complain that the OP didn't do that in the first place. Maybe next
time he will.

--
Chuck F () ()
Available for consulting/temporary embedded and systems.
<http://cbfalconer.home.att.net> USE worldnet address!