Sciweavers

1125 search results - page 12 / 225
» On the job rotation problem
Sort
View
COCOON
2009
Springer
13 years 6 months ago
An FPTAS for the Minimum Total Weighted Tardiness Problem with a Fixed Number of Distinct Due Dates
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...
George Karakostas, Stavros G. Kolliopoulos, Jing W...
ICALP
2000
Springer
14 years 5 days ago
Parallel Machine Scheduling Problems with Controllable Processing Times
We consider the problem of scheduling n independent jobs on m identical machines that operate in parallel. Each job has a controllable processing time. The fact that the jobs have...
Klaus Jansen, Monaldo Mastrolilli
JDA
2008
93views more  JDA 2008»
13 years 8 months ago
On-line scheduling of parallel jobs on two machines
We study the problem of on-line scheduling of parallel jobs on two machines. The jobs are parallel in the sense that each of them specifies the number of processors, in this case ...
Wun-Tat Chan, Francis Y. L. Chin, Deshi Ye, Guochu...
ICPR
2004
IEEE
14 years 9 months ago
Rotation Estimation from Spherical Images
Robotic navigation algorithms increasingly make use of the panoramic field of view provided by omnidirectional images to assist with localization tasks. Since the images taken by ...
Ameesh Makadia, Kostas Daniilidis, Lorenzo Sorgi
JSSPP
2004
Springer
14 years 1 months ago
Are User Runtime Estimates Inherently Inaccurate?
Computer system batch schedulers typically require information from the user upon job submission, including a runtime estimate. Inaccuracy of these runtime estimates, relative to ...
Cynthia Bailey Lee, Yael Schwartzman, Jennifer Har...