188 search results - page 12 / 38 » Regret Minimization and Job Scheduling |
DISOPT
2008
13 years 7 months ago
2008
The problem of scheduling groups of jobs on a single machine under the group technology assumption is studied. Jobs of the same group are processed contiguously and a sequence ind...
DAGSTUHL
2007
13 years 9 months ago
2007
Following recent interest in the strong price of anarchy (SPOA), we consider this measure, as well as the well known price of anarchy (POA) for the job scheduling problem on two u...
COCOON
2009
Springer
13 years 5 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...
IFIPTCS
2010
13 years 5 months ago
2010
We present in this paper a 5/2-approximation algorithm for scheduling rigid jobs on multi-organizations. For a given set of n jobs, the goal is to construct a schedule for N organi...
COR
2010
13 years 7 months ago
2010
The Flexible Job Shop scheduling Problem (FJSP) is a generalization of the classical Job Shop Problem in which each operation must be processed on a given machine chosen among a f...