Skip to main content

2015 | OriginalPaper | Buchkapitel

21. Production Planning for Make-to-Order Flow Shop System Under Hierarchical Workforce Environment

verfasst von : Sujan Piya, Nasr Al-Hinai

Erschienen in: Transactions on Engineering Technologies

Verlag: Springer Netherlands

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

search-config
loading …

Abstract

In make-to-order system orders are scheduled for production based on the due date agreed with customer and the strategy of company. Production planning of such system includes scheduling of orders to the production periods and allocation of workers at different work centers. Complexity in the system arises when the operation to perform next and its processing time is skilled dependent where a higher qualified worker type can substitute a lower qualified one, but not vice-versa. Under such working environment, efficient scheduling of orders and allocation of workers at different work center play major role to improve system performance. This paper develops a mathematical model for make-to-order flow shop system under hierarchical workforce environment. The model helps identify optimum schedule of orders and allocation of workers with an objective of minimizing the weighted average earliness and tardiness. A heuristic method is also proposed to overcome the complexity of mathematical model and solve the problem efficiently. Numerical analysis indicates that proposed heuristic is capable of finding optimal or near optimal solution in a considerably reduced amount of computational timing.

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!

Literatur
1.
Zurück zum Zitat Gallien, J., Tallec, Y.L., Schoenmery, T.: A Model for Make to Order Revenue Management. Sloan School of Management, Massachusetts Institute of Technology, Cambridge, MA (2004) (Working Paper) Gallien, J., Tallec, Y.L., Schoenmery, T.: A Model for Make to Order Revenue Management. Sloan School of Management, Massachusetts Institute of Technology, Cambridge, MA (2004) (Working Paper)
2.
Zurück zum Zitat Kreamer, K.L., Dedrick, J., Yamashiro, S.: Refining and extending the business model with information technology: Dell computer corporation. Inf. Soc. 16, 5–21 (2000)CrossRef Kreamer, K.L., Dedrick, J., Yamashiro, S.: Refining and extending the business model with information technology: Dell computer corporation. Inf. Soc. 16, 5–21 (2000)CrossRef
3.
Zurück zum Zitat Piya, S., Katsuhiko, T., Katsumi, M.: Introducing quotation and negotiation structure in the order acceptance decision model. Int. J. Oper. Quant. Manag. 15(4), 293–318 (2009) Piya, S., Katsuhiko, T., Katsumi, M.: Introducing quotation and negotiation structure in the order acceptance decision model. Int. J. Oper. Quant. Manag. 15(4), 293–318 (2009)
4.
Zurück zum Zitat Piya, S., Al-Hinai, N. Production planning under hierarchical workforce environment. Lecture Notes in Engineering and Computer Science: Proceedings of the World Congress on Engineering 2014, WCE 2014, London, 2–4 July 2014, pp. 1029–1033 Piya, S., Al-Hinai, N. Production planning under hierarchical workforce environment. Lecture Notes in Engineering and Computer Science: Proceedings of the World Congress on Engineering 2014, WCE 2014, London, 2–4 July 2014, pp. 1029–1033
5.
Zurück zum Zitat Applegate, D., Cook, W.: A computational study of the job shop scheduling problem. ORSA J. Comput. 02, 149–157 (1991)CrossRef Applegate, D., Cook, W.: A computational study of the job shop scheduling problem. ORSA J. Comput. 02, 149–157 (1991)CrossRef
6.
Zurück zum Zitat Brandimarte, P.: Routing and scheduling in a flexible job shop by tabu search. Ann. Oper. Res. 41, 157–183 (1993)MATHCrossRef Brandimarte, P.: Routing and scheduling in a flexible job shop by tabu search. Ann. Oper. Res. 41, 157–183 (1993)MATHCrossRef
7.
Zurück zum Zitat Lee, I., Shaw, M.J.: A neural net approach to real time flow shop sequencing. Comput. Ind. Eng. 38, 125–147 (2000)CrossRef Lee, I., Shaw, M.J.: A neural net approach to real time flow shop sequencing. Comput. Ind. Eng. 38, 125–147 (2000)CrossRef
8.
Zurück zum Zitat Kacem, I., Hammadi, S., Brone, P.: Approach by localization and multi-objective evolutionary optimization for flexible job-shop scheduling problems. IEEE Trans. Syst. Man Cybern. 32(1), 1–13 (2002)CrossRef Kacem, I., Hammadi, S., Brone, P.: Approach by localization and multi-objective evolutionary optimization for flexible job-shop scheduling problems. IEEE Trans. Syst. Man Cybern. 32(1), 1–13 (2002)CrossRef
9.
Zurück zum Zitat Toktas, B., Azizoglu, M., Koksalan, S.K.: Two machine flow shop scheduling with two criteria: maximum earliness and makespan. Eur. J. Oper. Res. 64, 278–285 (2004) Toktas, B., Azizoglu, M., Koksalan, S.K.: Two machine flow shop scheduling with two criteria: maximum earliness and makespan. Eur. J. Oper. Res. 64, 278–285 (2004)
10.
Zurück zum Zitat Tang, L., Liu, J., Liu, W.: A neural network model and algorithm for the hybrid flow shop scheduling problem in a dynamic environment. J. Intell. Manuf. 16, 361–370 (2005)CrossRef Tang, L., Liu, J., Liu, W.: A neural network model and algorithm for the hybrid flow shop scheduling problem in a dynamic environment. J. Intell. Manuf. 16, 361–370 (2005)CrossRef
11.
Zurück zum Zitat Liu, L., Gu, H., Xi, Y.: Robust and stable scheduling of a single machine with random machine breakdowns. Int. J. Adv. Manuf. Technol. 31, 645–654 (2007)CrossRef Liu, L., Gu, H., Xi, Y.: Robust and stable scheduling of a single machine with random machine breakdowns. Int. J. Adv. Manuf. Technol. 31, 645–654 (2007)CrossRef
12.
Zurück zum Zitat Yagamahan, B., Yenise, M.: Ant colony optimization for multi-objective flow shop scheduling problem. Comput. Ind. Eng. 54(3), 411–420 (2008)CrossRef Yagamahan, B., Yenise, M.: Ant colony optimization for multi-objective flow shop scheduling problem. Comput. Ind. Eng. 54(3), 411–420 (2008)CrossRef
13.
Zurück zum Zitat Pezzella, F., Morganti, G., Ciaschetti, G.: A genetic algorithm for the flexible job-shop scheduling problem. Comput. Oper. Res. 35, 3202–3212 (2008)MATHCrossRef Pezzella, F., Morganti, G., Ciaschetti, G.: A genetic algorithm for the flexible job-shop scheduling problem. Comput. Oper. Res. 35, 3202–3212 (2008)MATHCrossRef
14.
Zurück zum Zitat Xia, Y., Chen, B., Yue, J.: Job sequencing and due date assignment in a single machines shop with uncertain processing times. Eur. J. Oper. Res. 184, 63–75 (2008)MATHMathSciNetCrossRef Xia, Y., Chen, B., Yue, J.: Job sequencing and due date assignment in a single machines shop with uncertain processing times. Eur. J. Oper. Res. 184, 63–75 (2008)MATHMathSciNetCrossRef
15.
Zurück zum Zitat Manikas, A., Chang, Y.L.: Multi-criteria sequence-dependent job shop scheduling using genetic algorithms. Comput. Ind. Eng. 56(1), 179–185 (2009)CrossRef Manikas, A., Chang, Y.L.: Multi-criteria sequence-dependent job shop scheduling using genetic algorithms. Comput. Ind. Eng. 56(1), 179–185 (2009)CrossRef
16.
Zurück zum Zitat Sha, D.Y., Lin, H.H.: A multi-objective PSO for job-shop scheduling problems. Expert Syst. Appl. 37(2), 1065–1070 (2010)CrossRef Sha, D.Y., Lin, H.H.: A multi-objective PSO for job-shop scheduling problems. Expert Syst. Appl. 37(2), 1065–1070 (2010)CrossRef
17.
Zurück zum Zitat Al-Hinai, N., El Mekkawy, T.Y.: Robust and stable flexible job shop scheduling with random machine breakdowns using a hybrid genetic algorithm. Int. J. Prod. Econ. 132, 279–291 (2011)CrossRef Al-Hinai, N., El Mekkawy, T.Y.: Robust and stable flexible job shop scheduling with random machine breakdowns using a hybrid genetic algorithm. Int. J. Prod. Econ. 132, 279–291 (2011)CrossRef
18.
Zurück zum Zitat Seckiner, S.U., Gokcen, H., Kurt, M.: An integer programming model for hierarchical workforce scheduling problem. Eur. J. Oper. Res. 183, 694–699 (2007)MATHCrossRef Seckiner, S.U., Gokcen, H., Kurt, M.: An integer programming model for hierarchical workforce scheduling problem. Eur. J. Oper. Res. 183, 694–699 (2007)MATHCrossRef
19.
Zurück zum Zitat Emmons, H., Burns, R.N.: Off-day scheduling with hierarchical worker categories. Oper. Res. 39, 484–495 (1991)MATHCrossRef Emmons, H., Burns, R.N.: Off-day scheduling with hierarchical worker categories. Oper. Res. 39, 484–495 (1991)MATHCrossRef
20.
Zurück zum Zitat Hung, R.: Single-shift off-day scheduling of a hierarchical workforce with variable demands. Eur. J. Oper. Res. 78, 49–57 (1994)MATHCrossRef Hung, R.: Single-shift off-day scheduling of a hierarchical workforce with variable demands. Eur. J. Oper. Res. 78, 49–57 (1994)MATHCrossRef
21.
Zurück zum Zitat Narasihman, R.: An algorithm for single shift scheduling of hierarchical workforce. Eur. J. Oper. Res. 96, 113–121 (1996)CrossRef Narasihman, R.: An algorithm for single shift scheduling of hierarchical workforce. Eur. J. Oper. Res. 96, 113–121 (1996)CrossRef
22.
Zurück zum Zitat Billonnet, A.: Integer programming to schedule a hierarchical workforce with variable demands. Eur. J. Oper. Res. 114, 105–114 (1999)CrossRef Billonnet, A.: Integer programming to schedule a hierarchical workforce with variable demands. Eur. J. Oper. Res. 114, 105–114 (1999)CrossRef
23.
Zurück zum Zitat Narashiman, R.: An algorithm for multiple shift scheduling of hierarchical workforce on four-day or three-day workweeks. INFOR 38, 14–32 (2000) Narashiman, R.: An algorithm for multiple shift scheduling of hierarchical workforce on four-day or three-day workweeks. INFOR 38, 14–32 (2000)
24.
Zurück zum Zitat Al-Yaqoob, S.M., Sherali, H.D.: Multiple shift scheduling of hierarchical workforce with multiple work centers. J. Inf. 18(3), 325–342 (2007) Al-Yaqoob, S.M., Sherali, H.D.: Multiple shift scheduling of hierarchical workforce with multiple work centers. J. Inf. 18(3), 325–342 (2007)
25.
Zurück zum Zitat Pastor, R., Corominas, A.: A bicriteria integer programming model for the hierarchical workforce scheduling problem. J. Model. Manag. 5, 54–62 (2010)CrossRef Pastor, R., Corominas, A.: A bicriteria integer programming model for the hierarchical workforce scheduling problem. J. Model. Manag. 5, 54–62 (2010)CrossRef
26.
Zurück zum Zitat Ozguven, C., Sungur, B.: Integer programming models for hierarchical workforce scheduling problems including excess off-days and idle labor times. Appl. Math. Model. 37, 9117–9131 (2013)MathSciNetCrossRef Ozguven, C., Sungur, B.: Integer programming models for hierarchical workforce scheduling problems including excess off-days and idle labor times. Appl. Math. Model. 37, 9117–9131 (2013)MathSciNetCrossRef
Metadaten
Titel
Production Planning for Make-to-Order Flow Shop System Under Hierarchical Workforce Environment
verfasst von
Sujan Piya
Nasr Al-Hinai
Copyright-Jahr
2015
Verlag
Springer Netherlands
DOI
https://doi.org/10.1007/978-94-017-9804-4_21

    Marktübersichten

    Die im Laufe eines Jahres in der „adhäsion“ veröffentlichten Marktübersichten helfen Anwendern verschiedenster Branchen, sich einen gezielten Überblick über Lieferantenangebote zu verschaffen.