Sciweavers

120 search results - page 3 / 24
» Tractable Optimal Competitive Scheduling
Sort
View
ICALP
2004
Springer
13 years 11 months ago
Online Scheduling of Equal-Length Jobs: Randomization and Restarts Help
We consider the following scheduling problem. The input is a set of jobs with equal processing times, where each job is specified by its release time and deadline. The goal is to ...
Marek Chrobak, Wojciech Jawor, Jiri Sgall, Tom&aac...
CMOT
2000
105views more  CMOT 2000»
13 years 5 months ago
Generation Supply Bidding in Perfectly Competitive Electricity Markets
This paper reports on the development of a comprehensive framework for the analysis and formulation of bids in competitive electricity markets. Competing entities submit offers of...
George Gross, David Finlay
IPPS
2000
IEEE
13 years 10 months ago
Optimal on Demand Packet Scheduling in Single-Hop Multichannel Communication Systems
In this paper, we study the problem of on demand minimum length packet scheduling in single-hop multichannel systems. Examples of these systems are those centered around switching...
Maurizio A. Bonuccelli, Susanna Pelagatti
APPROX
2000
Springer
107views Algorithms» more  APPROX 2000»
13 years 10 months ago
Online real-time preemptive scheduling of jobs with deadlines
In this paper, we derive bounds on performance guarantees of online algorithms for real-time preemptive scheduling of jobs with deadlines on K machines when jobs are characterized ...
Bhaskar DasGupta, Michael A. Palis
AAAI
2004
13 years 7 months ago
An Effective Algorithm for Project Scheduling with Arbitrary Temporal Constraints
The resource-constrained project scheduling problem with time windows (RCPSP/max) is an important generalization of a number of well studied scheduling problems. In this paper, we...
Tristan B. Smith, John M. Pyle