Skip to main content

2016 | OriginalPaper | Buchkapitel

Output Rate Variation Problem: Some Heuristic Paradigms and Dynamic Programming

verfasst von : Gyan Bahadur Thapa, Sergei Silvestrov

Erschienen in: Engineering Mathematics II

Verlag: Springer International Publishing

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config
loading …

Abstract

The output rate variation problem stands as one of the important research directions in the area of multi-level just-in-time production system. In this short survey, we present the mathematical models of the problem followed by consideration of its NP-hardness. We further carry out the brief review of heuristic approaches that are devised to solve the problem. The dynamic programming approach and pegging assumption are also briefly discussed. The pegging assumption reduces the multi-level problem into weighted single-level problem. A couple of the open problems regarding ORVP are listed at the end.

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Literatur
1.
Zurück zum Zitat Bautista, J., Companys, R., Corominas, A.: Heuristics and exact algorithms for solving the Monden problem. Eur. J. Oper. Res. 88, 101–113 (1996)CrossRefMATH Bautista, J., Companys, R., Corominas, A.: Heuristics and exact algorithms for solving the Monden problem. Eur. J. Oper. Res. 88, 101–113 (1996)CrossRefMATH
2.
Zurück zum Zitat Dhamala, T.N., Kubiak, W.: A brief survey of just-in-time sequencing for mixed-model systems. Int. J. Oper. Res. 2(2), 38–47 (2005)MATH Dhamala, T.N., Kubiak, W.: A brief survey of just-in-time sequencing for mixed-model systems. Int. J. Oper. Res. 2(2), 38–47 (2005)MATH
3.
Zurück zum Zitat Dhamala, T.N., Thapa, G.B., Yu, H.: An efficient frontier for sum deviation just-in-time sequencing problem in mixed-model systems via apportionment. Int. J. Autom. Comput. 9(1), 87–97 (2012)CrossRef Dhamala, T.N., Thapa, G.B., Yu, H.: An efficient frontier for sum deviation just-in-time sequencing problem in mixed-model systems via apportionment. Int. J. Autom. Comput. 9(1), 87–97 (2012)CrossRef
4.
Zurück zum Zitat Duplaga, E., Bragg, D.: Mixed-model assembly line sequencing heuristics for smoothing component parts usage: a comparative analysis. Int. J. Prod. Res. 36(8), 2209–2224 (1998)CrossRefMATH Duplaga, E., Bragg, D.: Mixed-model assembly line sequencing heuristics for smoothing component parts usage: a comparative analysis. Int. J. Prod. Res. 36(8), 2209–2224 (1998)CrossRefMATH
5.
Zurück zum Zitat Fliedner, M., Boysen, N., Scholl, A.: Solving symmetric mixed-model multi-level just-in-time scheduling problems. Discret. Appl. Math. 158, 222–231 (2010)MathSciNetCrossRefMATH Fliedner, M., Boysen, N., Scholl, A.: Solving symmetric mixed-model multi-level just-in-time scheduling problems. Discret. Appl. Math. 158, 222–231 (2010)MathSciNetCrossRefMATH
6.
Zurück zum Zitat Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman and Co., New York, USA (1979)MATH Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman and Co., New York, USA (1979)MATH
7.
Zurück zum Zitat Garey, M.R., Johnson, D.S.: Complexity results for multiprocessor scheduling under resource constraints. SIAM J. Comput. 4(4), 397–411 (1975)MathSciNetCrossRefMATH Garey, M.R., Johnson, D.S.: Complexity results for multiprocessor scheduling under resource constraints. SIAM J. Comput. 4(4), 397–411 (1975)MathSciNetCrossRefMATH
8.
Zurück zum Zitat Goldstein, T., Miltenburg, J.: The effects of pegging in the scheduling of just-in-time production systems, Working paper, 294, Faculty of Business, McMaster University, Hamilton, Ontario (1998) Goldstein, T., Miltenburg, J.: The effects of pegging in the scheduling of just-in-time production systems, Working paper, 294, Faculty of Business, McMaster University, Hamilton, Ontario (1998)
9.
Zurück zum Zitat Khashouie, G.M.: Sequencing Mixed-model Assembly Lines in Just-in-time Production Systems, Department of Systems Engineering, Brunel University, UK (2003) Khashouie, G.M.: Sequencing Mixed-model Assembly Lines in Just-in-time Production Systems, Department of Systems Engineering, Brunel University, UK (2003)
10.
Zurück zum Zitat Korgaonker, M.G.: Just in Time Manufacturing. Macmillan India Ltd. (1992) Korgaonker, M.G.: Just in Time Manufacturing. Macmillan India Ltd. (1992)
11.
Zurück zum Zitat Kotani, S., Ito, T., Ohno, K.: Sequencing problem for a mixed-model assembly line in the Toyota production system. Int. J. Prod. Res. 42(23), 4955–4974 (2004)CrossRefMATH Kotani, S., Ito, T., Ohno, K.: Sequencing problem for a mixed-model assembly line in the Toyota production system. Int. J. Prod. Res. 42(23), 4955–4974 (2004)CrossRefMATH
12.
Zurück zum Zitat Kubiak, W.: Completion Time Variance Minimization on Single Machine is Difficult, Working paper, 92-6, Memorial University of Newfoundland (1992) Kubiak, W.: Completion Time Variance Minimization on Single Machine is Difficult, Working paper, 92-6, Memorial University of Newfoundland (1992)
13.
Zurück zum Zitat Kubiak, W.: Minimizing variation of production rates in just-in-time systems: a survey. Eur. J. Oper. Res. 66, 259–271 (1993)CrossRefMATH Kubiak, W.: Minimizing variation of production rates in just-in-time systems: a survey. Eur. J. Oper. Res. 66, 259–271 (1993)CrossRefMATH
14.
Zurück zum Zitat Kubiak, W., Sethi, S.: A note on level schedules for mixed-model assembly lines in just-in-time production systems. Manag. Sci. 37(1), 121–122 (1991)CrossRefMATH Kubiak, W., Sethi, S.: A note on level schedules for mixed-model assembly lines in just-in-time production systems. Manag. Sci. 37(1), 121–122 (1991)CrossRefMATH
15.
Zurück zum Zitat Kubiak, W., Sethi, S.: Optimal just-in-time schedules for flexible transfer lines. Int. J. Flex. Manuf. Syst. 6, 137–154 (1994)CrossRef Kubiak, W., Sethi, S.: Optimal just-in-time schedules for flexible transfer lines. Int. J. Flex. Manuf. Syst. 6, 137–154 (1994)CrossRef
16.
Zurück zum Zitat Kubiak, W., Steiner, G., Yeomans, J.: Optimal level schedules for mixed-model multi-level just-in-time assembly systems. Ann. Oper. Res. 69, 241–259 (1997)CrossRefMATH Kubiak, W., Steiner, G., Yeomans, J.: Optimal level schedules for mixed-model multi-level just-in-time assembly systems. Ann. Oper. Res. 69, 241–259 (1997)CrossRefMATH
17.
Zurück zum Zitat Lenstra, J.K., Rinnooy, A.H.G.: Computational complexity of discrete optimization problems. Ann. Discret. Math. 4, 121–140 (1979)MathSciNetCrossRefMATH Lenstra, J.K., Rinnooy, A.H.G.: Computational complexity of discrete optimization problems. Ann. Discret. Math. 4, 121–140 (1979)MathSciNetCrossRefMATH
18.
Zurück zum Zitat Miltenburg, J., Sinnamon, G.: Scheduling mixed-model multi-level just-in-time production systems. Int. J. Prod. Res. 27(9), 1487–1509 (1989)CrossRef Miltenburg, J., Sinnamon, G.: Scheduling mixed-model multi-level just-in-time production systems. Int. J. Prod. Res. 27(9), 1487–1509 (1989)CrossRef
19.
Zurück zum Zitat Miltenburg, J., Steiner, G., Yeomans, J.: A dynamic programming algorithm for scheduling mixed-model just-in-time production systems. Math. Comput. Model. 13(3), 57–66 (1990)MathSciNetCrossRefMATH Miltenburg, J., Steiner, G., Yeomans, J.: A dynamic programming algorithm for scheduling mixed-model just-in-time production systems. Math. Comput. Model. 13(3), 57–66 (1990)MathSciNetCrossRefMATH
20.
Zurück zum Zitat Monden, Y.: Toyota Production System; Practical Approach to Production Management. Industrial Engineering and Management Press, Norcross, GA (1983) Monden, Y.: Toyota Production System; Practical Approach to Production Management. Industrial Engineering and Management Press, Norcross, GA (1983)
21.
Zurück zum Zitat Okamura, K., Yamashina, H.: A heuristic algorithm for the assembly line model-mix sequencing problem to minimize the risk of stopping the conveyor. Int. J. Prod. Res. 17, 233–241 (1979)CrossRef Okamura, K., Yamashina, H.: A heuristic algorithm for the assembly line model-mix sequencing problem to minimize the risk of stopping the conveyor. Int. J. Prod. Res. 17, 233–241 (1979)CrossRef
22.
Zurück zum Zitat Papadimitriou, C., Steiglitz, K.: Combinatorial Optimization: Algorithms and Complexity. Prentice Hall of India (2003) Papadimitriou, C., Steiglitz, K.: Combinatorial Optimization: Algorithms and Complexity. Prentice Hall of India (2003)
23.
Zurück zum Zitat Steiner, G., Yeomans, J.: Optimal level schedules in mixed-model multi-level JIT assembly systems with pegging. Eur. J. Oper. Res. 95, 38–52 (1996)CrossRefMATH Steiner, G., Yeomans, J.: Optimal level schedules in mixed-model multi-level JIT assembly systems with pegging. Eur. J. Oper. Res. 95, 38–52 (1996)CrossRefMATH
24.
Zurück zum Zitat Sumichrast, R., Russell, R.: Evaluating mixed-model assembly line sequencing heuristics for just-in-time production systems. J. Oper. Manag. 9(3), 371–390 (1990)CrossRef Sumichrast, R., Russell, R.: Evaluating mixed-model assembly line sequencing heuristics for just-in-time production systems. J. Oper. Manag. 9(3), 371–390 (1990)CrossRef
25.
Zurück zum Zitat Sumichrast, R., Russell, R., Taylor, B.: A comparative analysis of sequencing procedures for mixed-model assembly lines in a just-in-time production system. Int. J. Prod. Res. 30(1), 199–214 (1992)CrossRefMATH Sumichrast, R., Russell, R., Taylor, B.: A comparative analysis of sequencing procedures for mixed-model assembly lines in a just-in-time production system. Int. J. Prod. Res. 30(1), 199–214 (1992)CrossRefMATH
26.
Zurück zum Zitat Thapa, G.B.: Computational complexity and integer programming. Mathematical Sciences and Applications, Kathmandu University, Nepal 60–70 (2006) Thapa, G.B.: Computational complexity and integer programming. Mathematical Sciences and Applications, Kathmandu University, Nepal 60–70 (2006)
27.
Zurück zum Zitat Thapa, G. B.: Optimization of Just-in-time Sequencing Problems and Supply Chain Logistics, Ph.D. Thesis, Division of Applied Mathematics, Mälardalen University, Sweden (2015) Thapa, G. B.: Optimization of Just-in-time Sequencing Problems and Supply Chain Logistics, Ph.D. Thesis, Division of Applied Mathematics, Mälardalen University, Sweden (2015)
28.
Zurück zum Zitat Thapa, G.B., Dhamala, T.N.: Just-in-time sequencing in mixed-model production systems relating with fair representation in apportionment theory. Nepali Math. Sci. Rep. 29(1&2), 29–68 (2009) Thapa, G.B., Dhamala, T.N.: Just-in-time sequencing in mixed-model production systems relating with fair representation in apportionment theory. Nepali Math. Sci. Rep. 29(1&2), 29–68 (2009)
29.
Zurück zum Zitat Thapa, G.B., Silvestrov, S.: Heuristics for single-level just-in-time sequencing problem. J. Inst. Sci. Technol. 18(2), 125–131 (2013) Thapa, G.B., Silvestrov, S.: Heuristics for single-level just-in-time sequencing problem. J. Inst. Sci. Technol. 18(2), 125–131 (2013)
30.
Zurück zum Zitat Thapa, G.B., Silvestrov, S.: Supply chain logistics in multi-level just-in-time production sequencing problems. J. Inst. Eng. 11(1), 91–100 (2015) Thapa, G.B., Silvestrov, S.: Supply chain logistics in multi-level just-in-time production sequencing problems. J. Inst. Eng. 11(1), 91–100 (2015)
Metadaten
Titel
Output Rate Variation Problem: Some Heuristic Paradigms and Dynamic Programming
verfasst von
Gyan Bahadur Thapa
Sergei Silvestrov
Copyright-Jahr
2016
DOI
https://doi.org/10.1007/978-3-319-42105-6_14