Sciweavers

159 search results - page 5 / 32
» Machine Minimization for Scheduling Jobs with Interval Const...
Sort
View
ORL
2002
81views more  ORL 2002»
14 years 9 months ago
On-line scheduling of unit time jobs with rejection: minimizing the total completion time
We consider on-line scheduling of unit time jobs on a single machine with job-dependent penalties. The jobs arrive on-line (one by one) and can be either accepted and scheduled, o...
Leah Epstein, John Noga, Gerhard J. Woeginger
IPCO
2007
98views Optimization» more  IPCO 2007»
14 years 10 months ago
Scheduling with Precedence Constraints of Low Fractional Dimension
Abstract. We consider the single machine scheduling problem to minimize the average weighted completion time under precedence constrains. Improving on the various 2-approximation a...
Christoph Ambühl, Monaldo Mastrolilli, Nikola...
CORR
2006
Springer
74views Education» more  CORR 2006»
14 years 9 months ago
Scheduling Algorithms for Procrastinators
This paper presents scheduling algorithms for procrastinators, where the speed that a procrastinator executes a job increases as the due date approaches. We give optimal off-line ...
Michael A. Bender, Raphaël Clifford, Kostas T...
WAOA
2004
Springer
132views Algorithms» more  WAOA 2004»
15 years 2 months ago
Stochastic Online Scheduling on Parallel Machines
We consider a non-preemptive, stochastic parallel machine scheduling model with the goal to minimize the weighted completion times of jobs. In contrast to the classical stochastic ...
Nicole Megow, Marc Uetz, Tjark Vredeveld
77
Voted
INFORMATICALT
2006
117views more  INFORMATICALT 2006»
14 years 9 months ago
Job Sequencing with Exponential Functions of Processing Times
We study single machine scheduling problems, where processing times of the jobs are exponential functions of their start times. For increasing functions, we prove strong NP-hardnes...
Adam Janiak, Mikhail Y. Kovalyov