Most computer operating systems must multi-task. They use a scheduling algorithm that decides which of the many processes can be run at any given time. It puts some jobs aside while others go through, ...

The paper is devoted to some single machine scheduling problems, where job processing times are defined by functions dependent on their positions in the sequence. It is assumed that each job is ...

A team of researchers from the University of Professional Studies, Accra, led by Dr. Augustina Dede Agor, has completed one of the most detailed global reviews to date on the integration of artificial ...

We consider a model for scheduling under uncertainty. In this model, we combine the main characteristics of online and stochastic scheduling in a simple and natural way. Job processing times are ...

From Computerworld Australia comes news that researchers at the University of Sydney have developed (and, sadly, patented) an algorithm that its inventors say will schedule jobs in a way that reduces ...