Journal: Computing

Found 11 papers in total
Some comments on sequencing with controllable processing items
2002,
We discuss sequencing problems on a single machine with controllable job processing...
Scheduling a single server in a two-machine flow shop
2003,
We study the problem of scheduling a single server that processes n jobs in a...
Notes on max flow time minimization with controllable processing times
2003,
In a scheduling problem with controllable processing times the job processing time can...
Tighter bounds on preemptive job shop scheduling with two machines
2001,
We consider the preemptive job shop scheduling problem with two machines, with the...
Risk theory with a nonlinear dividend barrier
2002,
In the framework of classical risk theory we investigate a surplus process in the...
On-line uniform machine scheduling with rejection
2000,
In this paper, we consider the problem of on-line uniform machine scheduling with...
On the complexity of non-preemptive shop scheduling with two jobs
2002,
In this note, we investigate the time complexity of non-preemptive shop scheduling...
Data mining with sparse grids
2001,
We present a new approach to the classification problem arising in data mining. It is...
Tighter bounds on preemptive job shop scheduling with two machines
2001,
We consider the preemptive job shop scheduling problem with two machines, with the...
Some comments on sequencing with controllable processing times
2002,
We discuss sequencing problems on a single machine with controllable job processing...
STABULUS: A technique for finding stable sets in large graphs with tabu search
1989,
Numerical experiments with tabu search have been carried out for constructing...
Papers per page: