Skip to main content

2018 | OriginalPaper | Buchkapitel

Scheduling Problem for Allocating Worker with Class-Type Skill in JSP by Hybrid Genetic Algorithm

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

search-config
loading …

Abstract

Scheduling in manufacturing systems is one of the most important and complex combinatorial optimization problems, where it can have a major impact on the productivity of a production process. Moreover, most of manufacturing scheduling models fall into the class of NP-hard combinatorial problems. In a real world manufacturing system, a plurality of worker who operates the machine exists, depending on the skill level by the workers for each machine and working time is different even if same work on the same machine in job-shop scheduling problem (JSP). Therefore, it is taking to account for differences in working time by the worker is scheduling problem with worker allocation. In this paper, in order to approach the more realistic model by dividing into several class workers and to determine the skill level for each machine for each class worker, we propose a new model that introduced the concept of class-type skill and demonstrate the effectiveness of the computational result by Hybrid Genetic Algorithm.

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 Mand AK, Hatanaka OH (2003) A heuristic algorithm for job-shop scheduling to minimize total weighted tardiness. J Jpn Ind Manage Assoc 51(3):245–253 (In Japanese) Mand AK, Hatanaka OH (2003) A heuristic algorithm for job-shop scheduling to minimize total weighted tardiness. J Jpn Ind Manage Assoc 51(3):245–253 (In Japanese)
2.
Zurück zum Zitat Cheng R, Gen M, Tsujimura Y (1996) A tutorial survey of job-shop scheduling problems using genetic algorithmsłi: representation. Comput Ind Eng 30(4):983–997CrossRef Cheng R, Gen M, Tsujimura Y (1996) A tutorial survey of job-shop scheduling problems using genetic algorithmsłi: representation. Comput Ind Eng 30(4):983–997CrossRef
3.
Zurück zum Zitat Cheng R, Gen M, Tsujimura Y (1999) A tutorial survey of job-shop scheduling problems using genetic algorithms: Part II. hybrid genetic search strategies. Comput Ind Eng 37(1C2):51–55CrossRef Cheng R, Gen M, Tsujimura Y (1999) A tutorial survey of job-shop scheduling problems using genetic algorithms: Part II. hybrid genetic search strategies. Comput Ind Eng 37(1C2):51–55CrossRef
4.
Zurück zum Zitat Gen M, Cheng R (1997) Genetic Algorithms and Engineering Design. Wiley, New York Gen M, Cheng R (1997) Genetic Algorithms and Engineering Design. Wiley, New York
5.
Zurück zum Zitat Gen M, Lin L (2014) Multiobjective evolutionary algorithm for manufacturing scheduling problems: state-of-the-art survey. J Intell Manufact 25(5):849–866MathSciNetCrossRef Gen M, Lin L (2014) Multiobjective evolutionary algorithm for manufacturing scheduling problems: state-of-the-art survey. J Intell Manufact 25(5):849–866MathSciNetCrossRef
6.
Zurück zum Zitat Gen M, Tsujimura Y, Kubota E (1994) Solving job-shop scheduling problems by genetic algorithm. In: IEEE International Conference on Systems, Man, and Cybernetics, 1994, Humans, Information and Technology, vol 2, pp 1577–1582 Gen M, Tsujimura Y, Kubota E (1994) Solving job-shop scheduling problems by genetic algorithm. In: IEEE International Conference on Systems, Man, and Cybernetics, 1994, Humans, Information and Technology, vol 2, pp 1577–1582
7.
Zurück zum Zitat Gen M, Cheng R, Lin L (2008) Network models and optimization: Multiobjective genetic algorithm approach Gen M, Cheng R, Lin L (2008) Network models and optimization: Multiobjective genetic algorithm approach
8.
Zurück zum Zitat Gen M, Lin L, Zhang W (2015) Multiobjective Hybrid Genetic Algorithms for Manufacturing Scheduling: Part I Models and Algorithms. Advances in Intelligent Systems and Computing. Springer, Heidelberg Gen M, Lin L, Zhang W (2015) Multiobjective Hybrid Genetic Algorithms for Manufacturing Scheduling: Part I Models and Algorithms. Advances in Intelligent Systems and Computing. Springer, Heidelberg
9.
Zurück zum Zitat Gen M, Zhang W, Lin L (2015) Multiobjective Hybrid Genetic Algorithms for Manufacturing Scheduling: Part II Case Studies of HDD and TFT-LCD. Advances in Intelligent Systems and Computing. Springer, Heidelberg Gen M, Zhang W, Lin L (2015) Multiobjective Hybrid Genetic Algorithms for Manufacturing Scheduling: Part II Case Studies of HDD and TFT-LCD. Advances in Intelligent Systems and Computing. Springer, Heidelberg
10.
Zurück zum Zitat Hirano H (1995) Genetic algorithm with cluster averaging method for solving job-shop scheduling sroblems. J Jpn Soc Artif Intell 27(5):769–777 (In Japanese) Hirano H (1995) Genetic algorithm with cluster averaging method for solving job-shop scheduling sroblems. J Jpn Soc Artif Intell 27(5):769–777 (In Japanese)
11.
Zurück zum Zitat Iima H, Sannomiya N (2002) Proposition of module type genetic algorithm and its application to modified scheduling problems with worker allocation. IEEJ Trans Electron Inf Syst 122C(3):409–416 (In Japanese) Iima H, Sannomiya N (2002) Proposition of module type genetic algorithm and its application to modified scheduling problems with worker allocation. IEEJ Trans Electron Inf Syst 122C(3):409–416 (In Japanese)
12.
Zurück zum Zitat Kitada M (2014) A study on a nurse scheduling system for unexpected absence of nurses. PhD thesis, Graduate School of Osaka Prefecture University, (In Japanese) Kitada M (2014) A study on a nurse scheduling system for unexpected absence of nurses. PhD thesis, Graduate School of Osaka Prefecture University, (In Japanese)
13.
Zurück zum Zitat Kurashima Y (2013) Scheduling problem with worker allocation for FSP. Master’s thesis, Maebashi Institute of Technology, (In Japanese) Kurashima Y (2013) Scheduling problem with worker allocation for FSP. Master’s thesis, Maebashi Institute of Technology, (In Japanese)
14.
Zurück zum Zitat Lawler EL, Lenstra JK (1993) Sequencing and scheduling: algorithms and complexity. Handb Ope Res Manage Sci 4(2):445–522 Lawler EL, Lenstra JK (1993) Sequencing and scheduling: algorithms and complexity. Handb Ope Res Manage Sci 4(2):445–522
15.
Zurück zum Zitat Osawa A, Ida K (2007) A solution method of scheduling problem with worker allocation by a genetic algorithm. IEEJ Trans Electron Inf Syst 127(5):755–761 (In Japanese) Osawa A, Ida K (2007) A solution method of scheduling problem with worker allocation by a genetic algorithm. IEEJ Trans Electron Inf Syst 127(5):755–761 (In Japanese)
16.
Zurück zum Zitat Singer M, Pinedo M (1998) A computational study of branch and bound techniques for minimizing the total weighted tardiness in job shops. IIE Trans 30(2):109–118 Singer M, Pinedo M (1998) A computational study of branch and bound techniques for minimizing the total weighted tardiness in job shops. IIE Trans 30(2):109–118
Metadaten
Titel
Scheduling Problem for Allocating Worker with Class-Type Skill in JSP by Hybrid Genetic Algorithm
verfasst von
Kenichi Ida
Daiki Takano
Mitsuo Gen
Copyright-Jahr
2018
DOI
https://doi.org/10.1007/978-3-319-59280-0_11

    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.