Sciweavers

200 search results - page 17 / 40
» Job Shop Scheduling Problems with Controllable Processing Ti...
Sort
View
IPL
2008
80views more  IPL 2008»
13 years 8 months ago
A simpler competitive analysis for scheduling equal-length jobs on one machine with restarts
We consider the online problem of scheduling jobs with equal processing times on a single machine. Each job has a release time and a deadline, and the goal is to maximize the numb...
Michael H. Goldwasser, Arundhati Bagchi Misra
DAGSTUHL
2006
13 years 10 months ago
Decentralization and Mechanism Design for Online Machine Scheduling
We study the online version of the classical parallel machine scheduling problem to minimize the total weighted completion time from a new perspective: We assume that the data of ...
Birgit Heydenreich, Rudolf Müller, Marc Uetz
CNSM
2010
13 years 6 months ago
DP+IP = design of efficient backup scheduling
Many industries experience an explosion in digital content. This explosion of electronic documents, along with new regulations and document retention rules, sets new requirements f...
Ludmila Cherkasova, Alex Zhang, Xiaozhou Li
DISOPT
2008
89views more  DISOPT 2008»
13 years 8 months ago
Group sequencing around a common due date
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...
T. C. Edwin Cheng, Mikhail Y. Kovalyov, C. T. Ng, ...
APPROX
2006
Springer
88views Algorithms» more  APPROX 2006»
14 years 17 days ago
Weighted Sum Coloring in Batch Scheduling of Conflicting Jobs
Motivated by applications in batch scheduling of jobs in manufacturing systems and distributed computing, we study two related problems. Given is a set of jobs {J1, . . . , Jn}, w...
Leah Epstein, Magnús M. Halldórsson,...