22 search results - page 3 / 5 » Parallel-machine scheduling with simple linear deterioration... |
ICALP
2004
Springer
14 years 22 days ago
2004
Springer
Consider the classical online scheduling problem where jobs that arrive one by one are assigned to identical parallel machines with the objective of minimizing the makespan. We gen...
SODA
2001
ACM
13 years 8 months ago
2001
ACM
We consider the problem of scheduling unit-length jobs on identical parallel machines such that the makespan of the resulting schedule is minimized. Precedence constraints impose ...
ICDCS
2006
IEEE
14 years 1 months ago
2006
IEEE
— We consider applications of sensor networks wherein data packets generated by every node have to reach the base station. This results in a many-to-one communication paradigm re...
IPCO
1998
13 years 8 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...
ESWA
2008
13 years 7 months ago
2008
The proportionate flow shop (PFS) is considered as a unique case of the flow shop problem in which the processing times of the operations belonging to the same job are equal. A pr...