301 search results - page 7 / 61 » Job Sequencing with Exponential Functions of Processing Time... |
101
click to vote
STOC
1997
ACM
15 years 1 months ago
1997
ACM
We study a classical problem in online scheduling. A sequence of jobs must be scheduled on m identical parallel machines. As each job arrives, its processing time is known. The goa...
PE
2006
Springer
14 years 9 months ago
2006
Springer
In this paper, we study the problem of dynamic allocation of the resources of a general parallel processing system, comprised of M heterogeneous processors and M heterogeneous tra...
FOCS
2008
IEEE
15 years 3 months ago
2008
IEEE
In the classic minimum makespan scheduling problem, we are given an input sequence of jobs with processing times. A scheduling algorithm has to assign the jobs to m parallel machi...
69
Voted
COR
2010
14 years 9 months ago
2010
The Flexible Job Shop scheduling Problem (FJSP) is a generalization of the classical Job Shop Problem in which each operation must be processed on a given machine chosen among a f...
MOR
2006
14 years 9 months ago
2006
Abstract. We solve the Poisson disorder problem when the delay is penalized exponentially. Our objective is to detect as quickly as possible the unobservable time of the change (or...