114 search results - page 13 / 23 » On the Robust Single Machine Scheduling Problem |
PODC
2010
ACM
13 years 11 months ago
2010
ACM
This paper introduces the distributed MAC protocol Jade. We consider a multi-hop wireless network with a single communication channel in which a powerful adversary is able to jam ...
AI
2003
Springer
14 years 19 days ago
2003
Springer
The multi-processor total tardiness problem (MPTTP) is an ÆÈ-hard scheduling problem, in which the goal is to minimise the tardiness of a set of jobs that are processed on a numb...
OSDI
2008
ACM
14 years 7 months ago
2008
ACM
Mitigating the impact of computer failure is possible if accurate failure predictions are provided. Resources, applications, and services can be scheduled around predicted failure...
ANOR
2010
13 years 4 months ago
2010
The rectangular assignment problem is a generalization of the linear assignment problem (LAP): one wants to assign a number of persons to a smaller number of jobs, minimizing the ...
WSC
1997
13 years 8 months ago
1997
For many companies the scheduling of job shops proves very difficult. Competing priorities (due dates, potential profit) from multiple customers confronts the plant manager with m...