188 search results - page 3 / 38 » Regret Minimization and Job Scheduling |
CORR
2004
Springer
13 years 6 months ago
2004
Springer
EOR
2007
13 years 6 months ago
2007
: New semiconductor wafer fabrication facilities use Front Opening Unified Pods (FOUPs) as a common unit of wafer transfer. Since the number of pods is limited due to high costs, a...
IPPS
2009
IEEE
14 years 23 days ago
2009
IEEE
—We consider a scheduling problem in which a bounded number of jobs can be processed simultaneously by a single machine. The input is a set of n jobs J = {J1, . . . , Jn}. Each j...
TCS
2008
13 years 6 months ago
2008
We study open-shop scheduling problems with job release times. The objective is to minimize the makespan. Dense schedules, easy to construct, are often used as approximate solutio...
ALGORITHMICA
2004
13 years 6 months ago
2004
We consider the problem of scheduling dynamically arriving jobs in a non-clairvoyant setting, that is, when the size of a job in remains unknown until the job finishes execution. ...