COCOON

2009

Springer

13 years 5 months ago
2009

Springer

Given a sequencing of jobs on a single machine, each one with a weight, processing time, and a due date, the tardiness of a job is the time needed for its completion beyond its du...

DISOPT

2008

13 years 6 months ago
2008

The problem of scheduling groups of jobs on a single machine under the group technology assumption is studied. Jobs of the same group are processed contiguously and a sequence ind...

JCO

2002

13 years 6 months ago
2002

The single machine scheduling problem with sum of completion times criterion (SS) can be solved easily by the Shortest Processing Time (SPT) rule. In the case of significant uncert...

EOR

2007

13 years 7 months ago
2007

Consider a single machine and a set of jobs that are available for processing at time 0. Job ¡ has a processing time ¢¤£ , a due date ¥¦£ and a weight §¨£ . We consid...

INFORMATICALT

2006

13 years 7 months ago
2006

We study single machine scheduling problems, where processing times of the jobs are exponential functions of their start times. For increasing functions, we prove strong NP-hardnes...

AAAI

2000

13 years 8 months ago
2000

Transpose-and-Cache Branch-and-Bound (TCBB) has shown promise in solving large single machine quadratic penalty problems. There exist other classes of single machine job sequencin...

WSC

2008

13 years 9 months ago
2008

Queueing theory is a well-known method for evaluating the performance of manufacturing systems. When we want to analyze the performance of a single machine, M/M/1 queues or approx...

ESWS

2010

Springer

13 years 11 months ago
2010

Springer

Abstract. The current state of the art regarding scalable reasoning consists of programs that run on a single machine. When the amount of data is too large, or the logic is too com...

ESA

2003

Springer

14 years 10 days ago
2003

Springer

In [2] it was shown that the obvious semi-clairvoyant generalization of the Shortest Processing Time is O(1)-competitive with respect to average stretch on a single machine. In [2...

ICIC

2007

Springer

14 years 1 months ago
2007

Springer

Electromagnetism-like algorithm (EM) is a population-based meta-heuristic which has been proposed to solve continuous problems eﬀectively. In this paper, we present a new meta-h...