Minimizing total weighted error for imprecise computation tasks and related problems

Handbook of Scheduling: Algorithms, Models, and Performance Analysis

Volumn , Issue , 2004, Pages 34-1-34-16

  Leung, Joseph Y T ^a  

^a University Heights   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 57749173343     PISSN: None     EISSN: None     Source Type: Book    
DOI: None     Document Type: Chapter

References (31)

1. J. Blazewicz, Scheduling preemptible tasks on parallel processors with information loss, Technique et Science Informatiques, 3(6), 415–420, 1984.
2. K-J. Lin, S. Natarajan, and J. W. S. Liu, Concord: a distributed system making use of imprecise results, In Proceedings of COMPSAC ’87, Tokyo, Japan, 1987.
3. K-J. Lin, S. Natarajan, and J. W. S. Liu, Imprecise results: utilizing partial computations in real-time systems, In Proceedings of the 8th Real-Time Systems Symposium, San Francisco, CA, 1987.
4. K-J. Lin, S. Natarajan, and J. W. S. Liu, Scheduling real-time, periodic job using imprecise results, In Proceedings of the 8th Real-Time Systems Symposium, San Francisco, CA, 1987.
5. J. W. S. Liu, K-J. Lin, S. W. Shih, A. C. Yu, J-Y. Chung, and W. Zhao, Algorithms for scheduling imprecise computations, IEEE Computers, 24, 58–68, 1991.
6. J. Blazewicz and G. Finke, Minimizing mean weighted execution time loss on identical and uniform processors, Information Processing Letters, 24, 259–263, 1987.
7. J. B. Orlin, A faster strongly polynomial minimum cost flow algorithm, In Proceedings of 20th ACM Symposium on Theory of Computing, 377–387, 1988.
8. D. S. Hochbaum and R. Shamir, Minimizing the number of tardy job unit under release time constraints, Discrete Applied Mathematics, 28, 45–57, 1990.
9. J. Y-T. Leung, V. K. M. Yu, and W-D. Wei, Minimizing the weighted number of tardy task units, Discrete Applied Mathematics, 51, 307–316, 1994.
10. C. N. Potts and L. N. Van Wassenhove, Single machine scheduling to minimize total late work, Operations Research, 40(3), 586–595, 1991.
11. C. N. Potts and L. N. VanWassenhove, Approximation algorithms for scheduling a single machine to minimize total late work, Operations Research Letters, 11, 261–266, 1992.
12. J. Y. Chung, W. K. Shih, J. W. S. Liu, and D. W. Gillies, Scheduling imprecise computations to minimize total error, Microprocessing and Microprogramming, 27, 767–774, 1989.
13. W. K. Shih, J. W. S. Liu, and J. Y. Chung, Algorithms for scheduling imprecise computations with timing constraints, SIAM Journal on Computing, 20, 537–552, 1991.
14. A. L. Liestman and R. H. Campbell, A fault-tolerant scheduling problem, IEEE Transactions on Software Engineering, 12, 1089–1095, 1986.
15. K. Ho, J. Y-T. Leung, and W-D. Wei, Scheduling imprecise computation tasks with 0/1-constraint, Discrete Applied Mathematics, 78, 117–132, 1997.
16. J. Blazewicz, E. Pesch, M. Sterna, and F. Werner, Open shop scheduling problems with late work criteria, Discrete Applied Mathematics, (to appear).
17. J. Blazewicz, E. Pesch, M. Sterna, and F. Werner, The two-machine flow-shop problemwithweighted late work criterion and common due date, European Journal of Operational Research (to appear).
18. M. Sterna, Problems and Algorithms in Non-Classical Shop Scheduling, Scientific Publishers of the Polish Academy of Sciences, Poznan, 2000.
19. K. Ho, J. Y-T. Leung, and W-D. Wei, Minimizing maximum weighted error for imprecise computation tasks, Journal of Algorithms, 16, 431–452, 1994.
20. H. N. Gabowand R. E. Tarjan, A linear-time algorithm for a special case of disjoint set union, Journal of Computing System and Science 30, 209–221, 1985.
21. W. A. Horn, Some simple scheduling algorithms, Naval Research Logistics Quarterly, 21, 177–185, 1974.
22. R. E. Tarjan, Data Structures and Network Algorithms, Society for Industrial and Applied Mathematics, Philadelphia, PA 1983.
23. A. Federgruen and H. Groenevelt, Preemptive scheduling of uniformmachines by ordinary network flow techniques, Management Science, 32, 341–349, 1986.
24. E. L. Lawler, A dynamic programming algorithm for preemptive scheduling of a single machine to minimize the number of late jobs, Annals of Operations Research, 26, 125–133, 1990.
25. S. M. Johnson, Optimal two- and three-stage production schedules, Naval Research Logistics Quarterly, 1, 61–68, 1954.
26. T. Gonzalez and S. Sahni, Open shop scheduling to minimize finish time, Journal of ACM, 23, 665–679, 1976.
27. H. Aydin, R. Melhem, and D. Mosse, Periodic reward-based scheduling and its application to poweraware real-time systems, chap. 36, this volume.
28. H. Hoogeveen and G. J. Woeginger, Some comments on sequencing with controllable processing times, Computing, 68, 181–192, 2002.
29. E. Nowicki and S. Zdrzalka, Asurvey of results for sequencing problemswith controllable processing times, Discrete Applied Mathematics, 26, 271–287, 1990.
30. N. V. Shakhlevich and V. A. Strusevich, Single machine scheduling with controllable release and processing parameters, Technical Report, School of Computing, University of Leeds, Leeds LS2 9JT, U. K., 2003.
31. V. A. Strusevich, Two machine flow shop scheduling problems with no-wait in process: controllable machine speeds, Discrete Applied Mathematics, 59, 75–86, 1995.