200 search results - page 12 / 40 » Job Shop Scheduling Problems with Controllable Processing Ti... |
AUSAI
2005
Springer
14 years 2 months ago
2005
Springer
This paper addresses the problem of scheduling jobs in soft real-time systems, where the utility of completing each job decreases over time. We present a utility-based framework fo...
JDA
2008
13 years 8 months ago
2008
We study the problem of on-line scheduling of parallel jobs on two machines. The jobs are parallel in the sense that each of them specifies the number of processors, in this case ...
COR
2011
13 years 3 months ago
2011
We consider the problem of scheduling a maximum profit selection of equal length jobs on m identical machines. Jobs arrive online over time and the goal is to determine a non-pre...
COR
2007
13 years 8 months ago
2007
When the processing times of jobs are controllable, selected processing times affect both the manufacturing cost and the scheduling performance.A well-known example for such a cas...
COCOON
2009
Springer
13 years 6 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...