The effect of machine availability on the worst-case performance of LPT

@article{Hwang2005TheEO,
  title={The effect of machine availability on the worst-case performance of LPT},
  author={Hark-Chin Hwang and Kangbok Lee and Soo Y. Chang},
  journal={Discrete Applied Mathematics},
  year={2005},
  volume={148},
  pages={49-61}
}
We consider themakespanminimization parallel machine scheduling problemwhere eachmachine may be unavailable for a known time interval. For this problem, we investigate how the worst-case behavior of the longest processing timefirst algorithm (LPT) is affectedby theavailability ofmachines. In particular, for givenmmachines, we analyze the cases where arbitrary number, , ranging from one tom−1, machines are unavailable simultaneously. Then, we show that the makespan of the schedule generated by… CONTINUE READING
8 Citations
17 References
Similar Papers

References

Publications referenced by this paper.
Showing 1-10 of 17 references

Tang,A note on Parallel machine scheduling with non-simultaneous machine available time

  • C. Y. Lee, G.C.Y. He
  • Discrete Appl. Math
  • 2000
1 Excerpt

MF algorithm for parallel machine scheduling with non-simultaneous machine available time

  • R. H. Li, Q. J. Gao
  • J. Nature Sci. Hunnan Normal Univ
  • 1999
1 Excerpt

Algorithms for multiprocessor scheduling with machine release

  • H. Kellerer
  • times, IIE Trans
  • 1998
1 Excerpt

Approximation Algorithms for NP-Hard Problems

  • D. S. Hochbaum
  • PWS Publishing Company, Boston,
  • 1997
2 Excerpts

A note on Parallel machine scheduling with non - simultaneous machine available time

  • Y. He, G. C. Tang
  • Discrete Appl . Math .
  • 1996

Similar Papers

Loading similar papers…