Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
1706358 | Applied Mathematical Modelling | 2010 | 6 Pages |
Abstract
This paper considers single machine scheduling problems with group technology (GT) and deteriorating jobs. We consider the case of jobs whose processing times are a simple linear function of their starting time. The two objectives of scheduling problems are to minimize the weighted sum of squared completion times and the weighted sum of squared waiting times, respectively. We also provide polynomial time algorithms to solve these problems.
Related Topics
Physical Sciences and Engineering
Engineering
Computational Mechanics
Authors
Cai-Min Wei, Ji-Bo Wang,