The maximum deviation just-in-time scheduling problem

Discrete Applied Mathematics

Volumn 134, Issue 1-3, 2004, Pages 25-50

  Brauner, N ^a   Crama, Y ^b  

^a Laboratoire Leibniz IMAG   (France)

^b UNIVERSITY OF LIÈGE   (Belgium)

Author keywords

Balanced words; Convex graphs; High multiplicity; Just in time; Scheduling; Sequencing

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; GRAPH THEORY; JUST IN TIME PRODUCTION; POLYNOMIALS; PROBLEM SOLVING; THEOREM PROVING;

CONVEX GRAPHS;

SCHEDULING;

EID: 0242335186     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0166-218X(03)00222-1     Document Type: Article

References (29)

1. E. Altman, B. Gaujal, A. Hordijk, Balanced sequences and optimal routing, J. ACM 47 (2000) 752-775.
2. Balinski M., Shahidi N. A simple approach to the product rate variation problem via axiomatics. Oper. Res. Lett. 22:1998;129-135.
3. Balinski M., Young H.P. The quota method of apportionment. Amer. Math. Monthly. 82:1975;701-730.
4. Bautista J., Companys R., Corominas A. A note on the relation between the product rate variation (PRV) problem and the apportionment problem. J. Oper. Res. Soc. 47:1996;1410-1414.
5. Bondy J.A., Murty U.S.R. Graph Theory with Applications. 1976;North-Holland, New York.
6. N. Brauner, Y. Crama, J. van de Klundert, A. Grigoriev, A note on the complexity of high-multiplicity optimization problems, Working Paper GEMME, University of Liège, Liège, 2001.
7. N. Brauner, V. Jost, W. Kubiak, On symmetric Fraenkel's and small deviations conjecture, Working paper, Les cahiers du laboratoire Leibniz, No 54, Grenoble, France, 2002.
8. Gabow H., Tarjan R.E. A linear-time algorithm for a special case of disjoint set union. J. Comput. System Sci. 30:1985;209-221.
9. Gallo G. An. O(n log n) algorithm for the convex bipartite matching problem Oper. Res. Lett. 3:1984;31-34.
10. Glover F. Maximum matching in a convex bipartite graph. Naval Res. Logistics Quart. 4:1967;313-316.
11. Grötschel M., Lovász L., Schrijver A. Geometric Algorithms and Combinatorial Optimization. 1993;Springer, Berlin.
12. Hochbaum D.S., Shamir R. Strongly polynomial algorithms for the high multiplicity scheduling problem. Oper. Res. 39:1991;648-653.
13. Inman R.R., Bulfin R.L. Sequencing JIT mixed-model assembly lines. Manage. Sci. 37:1991;901-904.
14. Kovalyov M.Y., Kubiak W., Yeomans J.S. A computational study of balanced JIT optimization algorithms. INFOR. 39:2001;299-316.
15. Kubiak W. Minimizing variation of production rates in just-in-time systems. a survey European J. Oper. Res. 66:1993;259-271.
16. W. Kubiak, Cyclic just-in-time sequences are optimal, Preprint, Memorial University of Newfoundland, St. John's, Canada, 2000.
17. Kubiak W., Sethi S.P. A note on level schedules for mixed-model assembly lines in just-in-time production systems. Manage. Sci. 37:1991;121-122.
18. Kubiak W., Sethi S.P. Optimal just-in-time schedules for flexible transfer lines. Internat. J. Flexible Manuf. Systems. 6:1994;137-154.
19. Kubiak W., Steiner G., Yeomans J.S. Optimal level schedules for mixed-model, multi level just-in-time assembly systems. Ann. Oper. Res. 69:1997;241-259.
20. Lenstra H.W. Jr. Integer programming with a fixed number of variables. Math. Oper. Res. 8:1983;538-548.
21. Lipski W. Jr., Preparata F.P. Efficient algorithms for finding maximum matchings in convex bipartite graphs and related problems. Acta Inform. 15:1981;329-346.
22. Miltenburg J. Level schedules for mixed-model assembly lines in just-in-time production systems. Manage. Sci. 35:1989;192-207.
23. Monden Y. Toyota Production System. 1983;Institute of Industrial Engineers, Norcross, GA.
24. Psaraftis H.N. A dynamic programming approach for sequencing groups of identical jobs. Oper. Res. 28:1980;347-359.
25. Steiner G., Yeomans J.S. Level schedules for mixed-model, Just-in-time processes. Manage. Sci. 39:1993;728-735.
26. Steiner G., Yeomans J.S. Optimal level schedules in mixed-model, multi level JIT assembly systems with pegging. European J. Oper. Res. 95:1996;38-52.
27. Tijdeman R. On complementary triples of Sturmian bisequences. Indagationes Math. 7:1996;419-424.
28. Tijdeman R. Exact covers of balanced sequences and Fraenkel's conjecture. Halter-Koch F., Tichy R.F. Algebraic Number Theory and Diophantine Analysis. 2000;467-483 Walter de Gruyter, Berlin.
29. Tijdeman R. Fraenkel's conjecture for six sequences. Discrete Math. 222:2000;223-234.