Single machine flow-time scheduling with scheduled maintenance

@article{Lee1992SingleMF,
  title={Single machine flow-time scheduling with scheduled maintenance},
  author={Chung-Yee Lee and Surya Danusaputro Liman},
  journal={Acta Informatica},
  year={1992},
  volume={29},
  pages={375-382}
}
In this paper, we investigate a single machine scheduling problem of minimizing the sum of job flow times subject to scheduled maintenance. We first provide an NP-completeness proof for the problem. This proof is much shorter than the one given in Adiri et al. [1]. The shortest processing time (SPT) sequence is then shown to have a worst case error bound of 2/7. Furthermore, an example is provided to show that the bound is tight. This example also serves as a counter-example to the 1/4 error… CONTINUE READING
70 Citations
3 References
Similar Papers

Citations

Publications citing this paper.
Showing 1-10 of 70 extracted citations

References

Publications referenced by this paper.
Showing 1-3 of 3 references

Various optimizers for single stage production

  • WE Smith
  • Naval Res. Log. Qu. 3, 59-66
  • 1956
1 Excerpt

Similar Papers

Loading similar papers…