Best Possible Approximation Algorithms for Single Machine Scheduling with Increasing Linear Maintenance Durations
We consider a single machine scheduling problem with multiple maintenance activities, where the maintenance duration function is of the linear form ft=a+bt with a≥0 and b>1. We propose an approximation algorithm named FFD-LS2I with a worst-case bound of 2 for problem. We also show that there is n...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Hindawi Limited
2014-01-01
|
| Series: | The Scientific World Journal |
| Online Access: | http://dx.doi.org/10.1155/2014/547573 |