25 search results - page 2 / 5 » On-line scheduling of unit time jobs with rejection: minimiz... |
INFORMATICALT
2006
13 years 5 months ago
2006
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...
COCOON
2009
Springer
13 years 3 months ago
2009
Springer
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...
COR
2008
13 years 5 months ago
2008
In many realistic situations, a job processed later consumes more time than the same job when it is processed earlier; this phenomenon is known as deteriorating jobs. However, job...
IPCO
1998
13 years 7 months ago
1998
We provide several non-approximability results for deterministic scheduling problems whose objective is to minimize the total job completion time. Unless P = NP, none of the probl...
AAIM
2007
Springer
13 years 11 months ago
2007
Springer
Packet scheduling in networks with quality of service constraints has been extensively studied as a single criterion scheduling problem. The assumption underlying single criterion ...