Fair sequences

Handbook of Scheduling: Algorithms, Models, and Performance Analysis

Volumn , Issue , 2004, Pages 19-1-19-22

  Kubiak, Wieslaw ^a  

^a MEMORIAL UNIVERSITY OF NEWFOUNDLAND   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

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

References (43)

1. Y. Monden (1983) Toyota Production Systems Industrial Engineering and Management Press, Norcross, GA.
2. R. Tijdeman (1980), The chairman assignment problem, Discrete Mathematics 32, 323–330.
3. J. G. Miltenburg (1989) Level schedules for mixed-model assembly lines in just-in-time production systems, Management Science 35, 192–207.
4. J. G. Miltenburg and T. Goldstein (1991) Developing production schedules which balance par usage and smooth production loads in just-in-time production systems, Naval Research Logistics 38, 893–910.
5. W. Kubiak, G. Steiner, and S. Yeomans (1997) Optimal level schedules in mixed-model, muli-level just-in-time assembly systems, Annals of Operations Research 69, 241–259.
6. A. Drexl and A. Kimms (2001) Sequencing JIT mixed-model assembly lines under station-load and part-usage constraints, Management Science, 47, 480–491.
7. R. Inman and R. Bulfin (1991) Sequencing JIT mixed-model assembly lines, Management Science 37, 901–904.
8. W. Kubiak and S. P. Sethi (1994) Optimal just-in-time schedules for flexible transfer lines, The International Journal of Flexible Manufacturing Systems 6, 137–154.
9. W. Kubiak and S. P. Sethi (1991) A note on level schedules for mixed-model assembly lines in justin- time production systems, Management Science 6, 137–154.
10. J. Bautista, R. Companys, and A. Corominas (1996) A note on the relation between the product rate variation (PRV) and the apportionment problem, Journal of Operational Research Society 47, 1410–1414.
11. M. Balinski and H. P. Young (1982) Fair Representation: Meeting the Ideal of One Man, One Vote, Yale University Press, New Haven, CT.
12. M. Balinski and N. Shahidi (1998) A simple approach to the product rate variation problem via axiomatics, Operations Research Letters 22, 129–135.
13. C. A. Waldspurger and W. E. Weihl (1995) Stride scheduling: deterministic proportional-share resource management. Technical Report MIT/LCS/TM-528, Massachusetts Institute of Technology, MIT Laboratory for Computer Science, June 1995.
14. E. Altman, B. Gaujal, and A. Hordijk (2000), Balanced sequences and optimal routing, Journal of ACM 47(4), 754–775.
15. R. Tijdeman (2000), Exact covers of balanced sequences and Fraenkel’s conjecture, in: Algebraic Number Theory and Diophantine Analysis, F. Halter-Koch and R. F. Tichy (eds.), Walter de Gruyter, Berlin, New York, 2000, 467–483.
16. N. Brauner and Y. Crama (2001) Facts and questions about the maximum deviation just-in-time scheduling problem, Research Report G. E. M. M. E. No 0104, University of Liège, Liège.
17. L. Vuillon (2003) Balanced words, Rapports de Recherche 2003-006, LIAFA CNRS, Université Paris 7.
18. H. Groenevelt (1993) The Just-in-Time Systems, in: A. H. G. RinnooyKan, andP. H. Zipkin, Handbooks in Operations research and Management Science Vol. 4 S. C. Graves, North Holland.
19. W. Kubiak (1993) Minimizing variation of production rates in just-in-time systems: a survey, European Journal of Operational Research 66, 259–271.
20. J. Bautista, R. Companys, and A. Corominas (1997) Modelling and solving the production ratevariation problem, TOP 5, 221–239.
21. H. W. Kuhn (1955) The Hungarian method for the asignment problem, Naval Research Logistics Quarterly 2, 83–97.
22. W. Kubiak (2003) Cyclic just-in-time sequences are optimal, Journal of Global Optimization, 27, 333–347.
23. G. Steiner and S. Yeomans (1993) Level schedules for mixed-model, just-in-time production processes, Management Science 39, 401–418.
24. F. Glover (1967) Maximum matching in a convex bipartite graph, Naval Research Logistics Quarterly 4, 313–316.
25. H. G. Meijer (1973) On a distribution problem in finite sets, Nederlands Akademie Wetenschappen Indag. Math. 35, 9–17.
26. N. Moreno Palli (2002) Solving the product rate variation problem (PRVP) of large dimensions as an assignment problem, Doctoral Thesis, Department D’Organitzacio D’Empreses, UPC, Barcelona.
27. V. Jost (2003) Deux problemes d’approximation Diophantine: Le patage proportionnel en nombres entries et Les pavages equilibres de Z, DEA ROCO, Laboratoire Leibniz-IMAG.
28. S. K. Baruah and S-S. Lin (1998) Pfair scheduling of generalized pinwheel task systems, IEEE, Transactions on Computers 47, 812–816.
29. C. L. Liu and J. W. Layland (1973) Scheduling algorithm for multiprogramming in a hard-real-time environment, Journal of ACM 20, 46–61.
30. R. Holte, A. Mok, L. Rosier, I. Tulchinsky, and D. Varvel (1989) The pinwheel: a real-time scheduling problem, Proceedings of the 22nd Hawaii International Conference on System Science, 693–702.
31. W. Kubiak (2003) The Liu-Layland problem revisited, MAPSP 2003, Aussois, France, 74–75. Fair Sequences 19-21
32. W. Kubiak (2003) On small deviations conjecture, Bulletin of the Polish Academy of Sciences 51, 189–203.
33. N. Brauner, V. Jost, and W. Kubiak (2002)Onsymmetric Fraenkel’s and small deviations conjectures. Les cahiers du Laboratoire Leibniz-IMAG, no 54, Grenoble, France.
34. J. Bent, V. Venkateshwaran, N. LeRoy, A. Roy, J. Stanley, A. C. Arpaci-Dusseau, R. H. Arapaci- Dusseau, and M. Livny (2002) Flexibility, manageability, and performance in a grid storage appliance. In Proceedings of the Eleventh IEEE Symposium on High Performance Distributed Computing, Edinburgh, Scotland, July 2002.
35. R. Tijdeman (2000) Fraenkel’s conjecture for six sequences, Discrete Mathematics, 2000, 222, 223–234.
36. H. S. Wilf (1994) Genratingfunctionology, Academic Press, 2nd ed., 1994.
37. M. Newman (1971) Roots of unity and covering sets, Mathematics Annals 191, 279–282.
38. S. Anily, C. A. Glass, and R. Hassin (1998), The scheduling of maintenance service, Discrete Applied Mathematics 82, 27–42.
39. A. Bar-Noy, R. Bhatia, J. Naor, and B. Schieber (1998) Minimizing service and operation costs of periodic scheduling. In Ninth Annual ACM-SIAM Symposium on Discrete Algorithms SODA, 1998, 11–20.
40. E. Kohler, R. Morris, B. Chen, J. Jannotti, and M. H. Kaashoek (2000) The click modular router, ACM Transactions on Computer Systems 18, 263–279.
41. M. Balinski and S. T. Rachev (1997) Rounding proportions: methods of rounding, Mathematical Scientis 22, 1–26.
42. W. Kubiak and N. Moreno Palli (2003) Towards the theory of stride scheduling, Optimization Days 2003, Montreal, Canada.
43. T. E. Vollman, W. L. Berry, and D. C. Wybark (1992) Manufacturing Planning and Control Systems, 3rd ed., IRWIN.