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

  • Kenichi IdaEmail author
  • Daiki Takano
  • Mitsuo Gen
Conference paper
Part of the Lecture Notes on Multidisciplinary Industrial Engineering book series (LNMUINEN)


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.


Job-shop scheduling problem (JSP) Scheduling problem for allocating worker (SPAW) Class-type skill Hybrid genetic algorithm 



This research work is supported by the Grant-in-Aid for Scientific Research (C) of Japan Society of Promotion of Science (JSPS): No. 15K00357.


  1. 1.
    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)Google Scholar
  2. 2.
    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–997CrossRefGoogle Scholar
  3. 3.
    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–55CrossRefGoogle Scholar
  4. 4.
    Gen M, Cheng R (1997) Genetic Algorithms and Engineering Design. Wiley, New YorkGoogle Scholar
  5. 5.
    Gen M, Lin L (2014) Multiobjective evolutionary algorithm for manufacturing scheduling problems: state-of-the-art survey. J Intell Manufact 25(5):849–866MathSciNetCrossRefGoogle Scholar
  6. 6.
    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–1582Google Scholar
  7. 7.
    Gen M, Cheng R, Lin L (2008) Network models and optimization: Multiobjective genetic algorithm approachGoogle Scholar
  8. 8.
    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, HeidelbergGoogle Scholar
  9. 9.
    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, HeidelbergGoogle Scholar
  10. 10.
    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)Google Scholar
  11. 11.
    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)Google Scholar
  12. 12.
    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)Google Scholar
  13. 13.
    Kurashima Y (2013) Scheduling problem with worker allocation for FSP. Master’s thesis, Maebashi Institute of Technology, (In Japanese)Google Scholar
  14. 14.
    Lawler EL, Lenstra JK (1993) Sequencing and scheduling: algorithms and complexity. Handb Ope Res Manage Sci 4(2):445–522Google Scholar
  15. 15.
    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)Google Scholar
  16. 16.
    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–118Google Scholar

Copyright information

© Springer International Publishing AG 2018

Authors and Affiliations

  1. 1.Graduate School of EngineeringMaebashi Institute of TechnologyMaebashiJapan
  2. 2.Fuzzy Logic Systems Institute and Tokyo University of ScienceTokyoJapan

Personalised recommendations