412 search results - page 5 / 83 » Parallel Machine Scheduling Problems with Controllable Proce... |
MOR
2000
13 years 6 months ago
2000
We consider the problem of scheduling a set of n jobs on m identical parallel machines so as to minimize the weighted sum of job completion times. This problem is NP-hard in the s...
DAGSTUHL
2006
13 years 8 months ago
2006
We study the online version of the classical parallel machine scheduling problem to minimize the total weighted completion time from a new perspective: We assume that the data of ...
COCOA
2008
Springer
13 years 8 months ago
2008
Springer
We consider the problem of minimizing the total weighted completion time on identical parallel machines when jobs have stochastic processing times and may arrive over time. We give...
EOR
2007
13 years 6 months ago
2007
A well known industry application that allows controllable processing times is the manufacturing operations on CNC machines. For each turning operation as an example, there is a n...
JCO
2002
13 years 6 months ago
2002
The single machine scheduling problem with sum of completion times criterion (SS) can be solved easily by the Shortest Processing Time (SPT) rule. In the case of significant uncert...