Table of Contents Author Guidelines Submit a Manuscript
Mobile Information Systems
Volume 2016, Article ID 9371563, 14 pages
http://dx.doi.org/10.1155/2016/9371563
Research Article

Minimizing the Average Waiting Time of Unequal-Size Data Items in a Mobile Computing Environment

Department of Computer Science and Information Management, Hungkuang University, Taichung 43302, Taiwan

Received 8 November 2015; Revised 19 February 2016; Accepted 29 February 2016

Academic Editor: Lingjie Duan

Copyright © 2016 Jen-Ya Wang. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Linked References

  1. S. Tainsky and M. Jasielec, “Television viewership of out-of-market games in league markets: traditional demand shifters and local team influence,” Journal of Sport Management, vol. 28, no. 1, pp. 94–108, 2014. View at Publisher · View at Google Scholar · View at Scopus
  2. K.-F. Jea and J.-Y. Wang, “Probabilistic service partition for parallel and distributed computing,” International Journal of Innovative Computing, Information and Control, vol. 6, no. 9, pp. 3887–3909, 2010. View at Google Scholar · View at Scopus
  3. S. Y. Chien and Y. T. Lin, “The effects of the service environment on perceived waiting time and emotions,” Human Factors and Ergonomics in Manufacturing & Service Industries, vol. 25, no. 3, pp. 319–328, 2015. View at Publisher · View at Google Scholar
  4. Z. Jin-Hong, J. Rui-Xuan, and Z. Gui, “Multi-item distribution policies with supply hub and lateral transshipment,” Mathematical Problems in Engineering, vol. 2015, Article ID 702482, 12 pages, 2015. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  5. Y.-T. Lin, K.-N. Xia, and L.-T. Bei, “Customer's perceived value of waiting time for service events,” Journal of Consumer Behaviour, vol. 14, no. 1, pp. 28–40, 2015. View at Publisher · View at Google Scholar · View at Scopus
  6. B. Zheng, X. Wu, X. Jin, and D. L. Lee, “Broadcast scheduling: TOSA: a near-optimal scheduling algorithm for multi-channel data broadcast,” in Proceedings of the 6th International Conference on Mobile Data Management (MDM '05), pp. 29–37, Ayia Napa, Cyprus, May 2005.
  7. E. Ardizzoni, A. A. Bertossi, M. C. Pinotti, S. Ramaprasad, R. Rizzi, and M. V. S. Shashanka, “Optimal skewed data allocation on multiple channels with flat broadcast per channel,” IEEE Transactions on Computers, vol. 54, no. 5, pp. 558–572, 2005. View at Publisher · View at Google Scholar · View at Scopus
  8. J.-L. Huang and M.-S. Chen, “Dependent data broadcasting for unordered queries in a multiple channel mobile environment,” IEEE Transactions on Knowledge and Data Engineering, vol. 16, no. 9, pp. 1143–1156, 2004. View at Publisher · View at Google Scholar · View at Scopus
  9. H.-F. Yu, “Efficient periodic broadcasting scheme for video delivery over a single channel,” Multimedia Tools and Applications, vol. 74, no. 15, pp. 5811–5824, 2015. View at Publisher · View at Google Scholar · View at Scopus
  10. D.-J. Chiang, C.-S. Wang, C.-L. Chen, and D.-J. Deng, “Real-time data delivery using prediction mechanism in mobile environments,” Wireless Personal Communications, vol. 74, no. 4, pp. 1345–1362, 2014. View at Publisher · View at Google Scholar · View at Scopus
  11. R. L. Burden and J. D. Faires, Numerical Analysis, Thomson Learning, 9th edition, 2011.
  12. W. G. Yee, S. B. Navathe, E. Omiecinski, and C. Jermaine, “Efficient data allocation over multiple channels at broadcast servers,” IEEE Transactions on Computers, vol. 51, no. 10, pp. 1231–1236, 2002. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  13. H. M. Soroush, “Scheduling with job-dependent past-sequence-dependent setup times and job-dependent position-based learning effects on a single processor,” European Journal of Industrial Engineering, vol. 9, no. 3, pp. 277–307, 2015. View at Publisher · View at Google Scholar · View at Scopus
  14. G.-J. Sheen and L.-W. Liao, “A branch and bound algorithm for the one-machine scheduling problem with minimum and maximum time lags,” European Journal of Operational Research, vol. 181, no. 1, pp. 102–116, 2007. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus
  15. W.-C. Peng and M.-S. Chen, “Efficient channel allocation tree generation for data broadcasting in a mobile computing environment,” Wireless Networks, vol. 9, no. 2, pp. 117–129, 2003. View at Publisher · View at Google Scholar · View at Scopus
  16. W.-C. Peng, J.-L. Huang, and M.-S. Chen, “Dynamic leveling: adaptive data broadcasting in a mobile computing environment,” Mobile Networks and Applications, vol. 8, no. 4, pp. 355–364, 2003. View at Publisher · View at Google Scholar · View at Scopus
  17. R. C. T. Lee, R. C. Chang, S. S. Tseng, and Y. T. Tsai, Introduction to the Design and Analysis of Algorithms, Unalis Press, 1999.
  18. J. M. Ortega and W. C. Rheinboldt, Iterative Solution of Nonlinear Equations in Several Variables, SIAM, Philadelphia, Pa, USA, 2000.
  19. T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein, Introduction to Algorithms, The MIT Press, London, UK, 13rd edition, 2009.
  20. K.-F. Jea, J.-Y. Wang, and S.-Y. Chen, “A linearly convergent method for broadcast data allocation,” Computers & Mathematics with Applications, vol. 56, no. 2, pp. 324–338, 2008. View at Publisher · View at Google Scholar · View at Scopus
  21. J.-Y. Wang and K.-F. Jea, “A near-optimal database allocation for reducing the average waiting time in the grid computing environment,” Information Sciences, vol. 179, no. 21, pp. 3772–3790, 2009. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  22. T. Dede, S. Bekirolu, and Y. Ayvaz, “Weight minimization of trusses with genetic algorithm,” Applied Soft Computing Journal, vol. 11, no. 2, pp. 2565–2575, 2011. View at Publisher · View at Google Scholar · View at Scopus
  23. A. Karimi, H. Nobahari, and P. Siarry, “Continuous ant colony system and tabu search algorithms hybridized for global minimization of continuous multi-minima functions,” Computational Optimization and Applications, vol. 45, no. 3, pp. 639–691, 2010. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  24. C. R. Scrich, V. A. Armentano, and M. Laguna, “Tardiness minimization in a flexible job shop: a tabu search approach,” Journal of Intelligent Manufacturing, vol. 15, no. 1, pp. 103–115, 2004. View at Publisher · View at Google Scholar · View at Scopus
  25. J.-Y. Wang and J.-S. Chen, “A data partition method for mems-based storage devices in a distributed computing environment,” International Journal of Software Engineering and Knowledge Engineering, vol. 23, no. 1, pp. 101–115, 2013. View at Publisher · View at Google Scholar · View at Scopus