Skip to main content

2018 | OriginalPaper | Buchkapitel

Single Machine Weighted Tardiness Problem: An Algorithm and Experimentation System

verfasst von : Kacper Petrynski, Robert Szost, Iwona Pozniak-Koszalka, Leszek Koszalka, Andrzej Kasprzak

Erschienen in: Computational Collective Intelligence

Verlag: Springer International Publishing

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

search-config
loading …

Abstract

This paper concentrates on the created algorithm for solving the single machine total weighted tardiness problem (SMTWT). The algorithm is based on searching the solution space along with the tree rules. The properties of the algorithm are studied taking into account the results of experiments made using the designed and implemented experimentation system. This system allows testing various configurations of the algorithm as well as comparing the effects obtained by this algorithm with effects of known meta-heuristic algorithms, which are based on Simulated Annealing and Invasive Weed Optimization. The paper shows that the proposed algorithm requires some improvements, however seems to be promising.

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
2.
Zurück zum Zitat Lenstra, J.K., Rinnooy Kan, A.H.G., Brucker, P.: Complexity of machine scheduling problem. Ann. Discrete Math. 1, 343–362 (1977)MathSciNetCrossRef Lenstra, J.K., Rinnooy Kan, A.H.G., Brucker, P.: Complexity of machine scheduling problem. Ann. Discrete Math. 1, 343–362 (1977)MathSciNetCrossRef
3.
Zurück zum Zitat Cheng, T.C.E., Ng, C.T., Yuan, J.J., Liu, Z.H.: Single machine scheduling to minimize total weighted tardiness. Eur. J. Oper. Res. 165, 423–443 (2005)MathSciNetCrossRef Cheng, T.C.E., Ng, C.T., Yuan, J.J., Liu, Z.H.: Single machine scheduling to minimize total weighted tardiness. Eur. J. Oper. Res. 165, 423–443 (2005)MathSciNetCrossRef
4.
Zurück zum Zitat Geiger, M.J.: On heuristic search for the single machine total weighted tardiness problem – some theoretical insights and their empirical verification. Eur. J. Oper. Res. 207, 1235–1243 (2010)MathSciNetCrossRef Geiger, M.J.: On heuristic search for the single machine total weighted tardiness problem – some theoretical insights and their empirical verification. Eur. J. Oper. Res. 207, 1235–1243 (2010)MathSciNetCrossRef
5.
Zurück zum Zitat Congram, R.K., Pons, C.N., Van de Velde, S.I.: An iterated dyna-search algorithm for the single machine total weighted tardiness scheduling problem. J. Comput. 14, 52–67 (2000) Congram, R.K., Pons, C.N., Van de Velde, S.I.: An iterated dyna-search algorithm for the single machine total weighted tardiness scheduling problem. J. Comput. 14, 52–67 (2000)
6.
Zurück zum Zitat Ferrolho, A. Crisostomo, M.: Single machine total weighted tardiness problem with genetic algorithm. IEEE (2007) Ferrolho, A. Crisostomo, M.: Single machine total weighted tardiness problem with genetic algorithm. IEEE (2007)
7.
Zurück zum Zitat Krol, D., Zydek, D., Koszalka, L.: Problem-indepenent approach to multiprocessor dependent task scheduling. Int. J. Electron. Telecommun. 58(4), 369–379 (2012)CrossRef Krol, D., Zydek, D., Koszalka, L.: Problem-indepenent approach to multiprocessor dependent task scheduling. Int. J. Electron. Telecommun. 58(4), 369–379 (2012)CrossRef
8.
Zurück zum Zitat Bilge, U., Kurtulan, M., Kirac, F.: A tabu search algorithm for the single machine total weighted tardiness problem. Eur. J. Oper. Res. 176, 1423–1435 (2007)MathSciNetCrossRef Bilge, U., Kurtulan, M., Kirac, F.: A tabu search algorithm for the single machine total weighted tardiness problem. Eur. J. Oper. Res. 176, 1423–1435 (2007)MathSciNetCrossRef
9.
Zurück zum Zitat Van Laarhoven, P.J., Aarts, E.H., Lenstra, J.K.: Job shop scheduling by simulated annealing. Oper. Res. 40(1), 113–125 (1992)MathSciNetCrossRef Van Laarhoven, P.J., Aarts, E.H., Lenstra, J.K.: Job shop scheduling by simulated annealing. Oper. Res. 40(1), 113–125 (1992)MathSciNetCrossRef
10.
Zurück zum Zitat Szumega, J.: Metaheuristic algorithms for solving the single machine total weighted tardiness problem. Report of Faculty of Electronics, Wroclaw University of Science and Technology, Wroclaw (2015) Szumega, J.: Metaheuristic algorithms for solving the single machine total weighted tardiness problem. Report of Faculty of Electronics, Wroclaw University of Science and Technology, Wroclaw (2015)
11.
Zurück zum Zitat Sabamoniri, S., Asghari, K., Hosseini, J.M.: Solving single machine total weighted tardiness problem using variable structure learning automata. Int. J. Comput. Appl. (2012) Sabamoniri, S., Asghari, K., Hosseini, J.M.: Solving single machine total weighted tardiness problem using variable structure learning automata. Int. J. Comput. Appl. (2012)
12.
Zurück zum Zitat Cakar, T., Koker, R.: Solving single machine total weighted tardiness problem with unequal release date using neurohybrid particle swarm optimization approach. Comput. Intell. Neurosci. (2015) Cakar, T., Koker, R.: Solving single machine total weighted tardiness problem with unequal release date using neurohybrid particle swarm optimization approach. Comput. Intell. Neurosci. (2015)
13.
Zurück zum Zitat Tasgetiren, M.F., Sevkli, M., Liang, Y-C., Gencyilmaz, G.: Particle swarm optimization algorithm for single machine total weighted tardiness problem. In: Proceedings of Congress on Evolutionary Computation (2004) Tasgetiren, M.F., Sevkli, M., Liang, Y-C., Gencyilmaz, G.: Particle swarm optimization algorithm for single machine total weighted tardiness problem. In: Proceedings of Congress on Evolutionary Computation (2004)
14.
Zurück zum Zitat Kostrzewa, D., Josinski, H.: The comparison of an adapted evolutionary algorithm with the invasive weed optimization algorithm based on the problem of predetermining the progress of distributed data merging process. In: Cyran, K.A., Kozielski, S., Peters, J.F., Stańczyk, U., Wakulicz-Deja, A. (eds.) Man-Machine Interactions. Advances in Intelligent and Soft Computing, vol. 59, pp. 505–514. Springer, Heidelberg (2009). https://doi.org/10.1007/978-3-642-00563-3_53CrossRef Kostrzewa, D., Josinski, H.: The comparison of an adapted evolutionary algorithm with the invasive weed optimization algorithm based on the problem of predetermining the progress of distributed data merging process. In: Cyran, K.A., Kozielski, S., Peters, J.F., Stańczyk, U., Wakulicz-Deja, A. (eds.) Man-Machine Interactions. Advances in Intelligent and Soft Computing, vol. 59, pp. 505–514. Springer, Heidelberg (2009). https://​doi.​org/​10.​1007/​978-3-642-00563-3_​53CrossRef
15.
Zurück zum Zitat Henderson, D., Jacobson, S.H., Johnson, A.W.: The theory and practice of simulated annealing. In: Glover, F., Kochenberger, G.A. (eds.) Handbook of Metaheuristics. International Series in Operations Research and Management Science, vol. 57, pp. 287–319. Springer, Boston (2003). https://doi.org/10.1007/0-306-48056-5_10CrossRef Henderson, D., Jacobson, S.H., Johnson, A.W.: The theory and practice of simulated annealing. In: Glover, F., Kochenberger, G.A. (eds.) Handbook of Metaheuristics. International Series in Operations Research and Management Science, vol. 57, pp. 287–319. Springer, Boston (2003). https://​doi.​org/​10.​1007/​0-306-48056-5_​10CrossRef
16.
Zurück zum Zitat Bogalinski, P., Davies, D., Koszalka, L., Pozniak-Koszalka, I., Kasprzak, A.: Evaluation of strip nesting algorithms: an experimentation system for the practical users. J. Intell. Fuzzy Syst. 27(2), 611–623 (2014) Bogalinski, P., Davies, D., Koszalka, L., Pozniak-Koszalka, I., Kasprzak, A.: Evaluation of strip nesting algorithms: an experimentation system for the practical users. J. Intell. Fuzzy Syst. 27(2), 611–623 (2014)
17.
Zurück zum Zitat Hudziak, M., Pozniak-Koszalka, I., Koszalka, L., Kasprzak, A.: Multi-agent pathfinding in the crowded environment with obstacles: algorithms and experimentation system. J. Intell. Fuzzy Syst. 32(2), 1561–1578 (2017)CrossRef Hudziak, M., Pozniak-Koszalka, I., Koszalka, L., Kasprzak, A.: Multi-agent pathfinding in the crowded environment with obstacles: algorithms and experimentation system. J. Intell. Fuzzy Syst. 32(2), 1561–1578 (2017)CrossRef
Metadaten
Titel
Single Machine Weighted Tardiness Problem: An Algorithm and Experimentation System
verfasst von
Kacper Petrynski
Robert Szost
Iwona Pozniak-Koszalka
Leszek Koszalka
Andrzej Kasprzak
Copyright-Jahr
2018
DOI
https://doi.org/10.1007/978-3-319-98446-9_4