Solution of the Liu-Layland problem via bottleneck just-in-time sequencing

Journal of Scheduling

Volumn 8, Issue 4, 2005, Pages 295-302

  Kubiak, Wieslaw ^a  

^a MEMORIAL UNIVERSITY OF NEWFOUNDLAND   (Canada)

Author keywords

Apportionment problem; Hard real time systems; Just in time sequencing; Periodic scheduling; The Liu Layland problem

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; MATHEMATICAL MODELS; OPTIMIZATION; PROBLEM SOLVING; SET THEORY;

APPORTIONMENT PROBLEMS; HARD REAL TIME SYSTEMS; JUST IN TIME SEQUENCING; PERIODIC SCHEDULING; THE LIU-LAYLAND PROBLEMS;

SCHEDULING;

EID: 21144440475     PISSN: 10946136     EISSN: None     Source Type: Journal    
DOI: 10.1007/s10951-005-1638-5     Document Type: Conference Paper

References (18)

1. Balinski, M. and H. P. Young, "The quota method of apportionment," American Mathematics Monthly, 82, 701-730 (1975).
2. Blazewicz, J., K. Ecker, E. Pesch, G. Schmidt, and J. Weglarz, Scheduling Computer and Manufacturing Processes, 2nd edition, Springer, Berlin, 1996.
3. Bratley, P., M. Florian, and P. Robillard, "Scheduling with earliest start and due date constraints," Naval Research Logistics Quarterly, 78, 511-517 (1971).
4. Brauner, N. and Y. Crama, "The maximum deviation just-in-time scheduling problem," Discrete Applied Mathematics, 134, 25-50 (2004).
5. Brauner, N., V. Jost, and W. Kubiak, "On symmetric Fraenkel's and small deviations conjectures," Lescahiers du Laboratoire Leibniz-IMAG, no 54, Grenoble, France, 2002.
6. Buttazzo, G. C., Predictable Scheduling Algorithms and Applications, Hard Real-Time Computing Systems, Kluwer Academic Publishers, Dordrecht, 1997.
7. Bertouzos, M., "Control Robotics: The procedural control of physical processes," in Proceedings of IFIP Congress, 1974, pp. 807-813.
8. Devillers, R. and J. Goossens, "Liu and Layland's schedulability test revisited," Information Processing Letters, 73, 157-161 (2000).
9. Glover, F., "Maximum matching in a convex bipartite graph," Naval Research Logistics Quarterly, 4, 313-316 (1967).
10. Kubiak, W., "On small deviations conjecture," Bulletin of the Polish Academy of Sciences, 51, 189-203 (2003).
11. Kubiak, W. and S. P. Sethi, "A Note on 'Level schedules for mixed-model assembly lines in just-in-time production systems," Management Science. 37, 121-122 (1991).
12. Kubiak, W. and S. P. Sethi "Optimal just-in-time schedules for flexible transfer lines," The International Journal of Flexible Manufacturing Systems, 6, 137-154 (1994).
13. Lawler, E., Combinatorial Optimization. Networks and Matroids, Holt, Rinehart & Winston, New York, 1976.
14. Liu, C. L. and J. W. Layland, "Scheduling algorithm for multiprogramming in a hard real-time environment," Journal of ACM, 20, 46-61 (1973).
15. Monden, Y., Toyota Production Systems, Industrial Engineering and Management Press, Norcross, GA, 1983.
16. Still J. W, "A class of new methods for congressional apportionment," SIAM Journal of Applied Mathematics, 37,401-418 1979.
17. Steiner, G. and S. Yeomans, "Level schedules for mixed-model, just-in-time production processes," Management Science, 39, 401-418 (1993).
18. Tijdeman, R., "The chairman assignment problem," Discrete Mathematics, 32, 323-330 (1980).