Sciweavers

22 search results - page 1 / 5
» Parallel-machine scheduling with simple linear deterioration...
Sort
View
MOR
2000
90views more  MOR 2000»
13 years 4 months ago
A PTAS for Minimizing the Total Weighted Completion Time on Identical Parallel Machines
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...
Martin Skutella, Gerhard J. Woeginger
COCOA
2008
Springer
13 years 6 months ago
Stochastic Online Scheduling Revisited
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...
Andreas S. Schulz
COR
2008
69views more  COR 2008»
13 years 4 months ago
Single-machine group scheduling problems with deterioration consideration
In many realistic situations, a job processed later consumes more time than the same job when it is processed earlier; this phenomenon is known as deteriorating jobs. However, job...
Chin-Chia Wu, Yau-Ren Shiau, Wen-Chiung Lee
JCO
1998
80views more  JCO 1998»
13 years 4 months ago
Improved Bounds on Relaxations of a Parallel Machine Scheduling Problem
We consider the problem of scheduling n jobs with release dates on m identical parallel machines to minimize the average completion time of the jobs. We prove that the ratio of the...
Cynthia A. Phillips, Andreas S. Schulz, David B. S...