Modelling of job-shop scheduling with multiple quantitative and qualitative objectives and a GA/TS mixture approach

In this research, an integrated approach to modelling the job shop scheduling problems, along with a genetic algorithm/tabu search mixture solution approach, is proposed. The multiple objective functions modelled include both multiple quantitative (time and production) and multiple qualitative (marketing) objectives. In addition, realistic issues, such as the uncertainty aspect, rescheduling, relative importance of criteria, and alternative process plans with the GA/TS approach, are also modelled within the framework of the multi-objective functions, with the aids of fuzzy set theory, the analytic hierarchy process, and dynamic probability distribution. The implementation of the genetic algorithm/tabu search solution approach and the rescheduling scheme is supported and demonstrated by illustrative examples and computational results by this approach.

[1]  Fred W. Glover,et al.  Tabu Search - Part I , 1989, INFORMS J. Comput..

[2]  J. Barnes,et al.  Solving the job shop scheduling problem with tabu search , 1995 .

[3]  Rong-Kwei Li,et al.  A heuristic rescheduling algorithm for computer-based production scheduling systems , 1993 .

[4]  Fred Glover,et al.  Tabu Search - Part II , 1989, INFORMS J. Comput..

[5]  M. Kuroda,et al.  Fuzzy Job Shop Scheduling , 1996 .

[6]  Tae-Eog Lee,et al.  A tabu search procedure for periodic job shop scheduling , 1996 .

[7]  Gunar E. Liepins,et al.  Genetic algorithms: Foundations and applications , 1990 .

[8]  Belarmino Adenso-Díaz,et al.  An SA/TS mixture algorithm for the scheduling tardiness problem , 1996 .

[9]  Hideo Tanaka,et al.  Genetic algorithms and neighborhood search algorithms for fuzzy flowshop scheduling problems , 1994 .

[10]  Hiroaki Ishii,et al.  One machine scheduling problem with fuzzy duedates , 1994 .

[11]  T. Saaty.  Fundamentals of Decision Making and Priority Theory With the Analytic Hierarchy Process , 2000 .

[12]  M. Gen,et al.  An effective method for solving flow shop scheduling problems with fuzzy processing times , 1993 .

[13]  Kenneth A. De Jong,et al.  Using Genetic Algorithms to Solve NP-Complete Problems , 1989, ICGA.

[14]  Hiroaki Ishii,et al.  Two scheduling problems with fuzzy due-dates , 1992 .

[15]  H. Ishibuchi,et al.  Multi-objective genetic algorithm and its applications to flowshop scheduling , 1996 .

[16]  Mitsuo Gen,et al.  A tutorial survey of job-shop scheduling problems using genetic algorithms—I: representation , 1996 .

[17]  Kurt Hornik,et al.  Multilayer feedforward networks are universal approximators , 1989, Neural Networks.

[18]  Yuehwern Yih,et al.  Integration of inductive learning and neural networks for multi-objective FMS scheduling , 1998 .

[19]  Richard L. Daniels,et al.  Incorporating preference information into multi-objective scheduling , 1994 .

[20]  Hisao Ishibuchi,et al.  Performance evaluation of genetic algorithms for flowshop scheduling problems , 1994, Proceedings of the First IEEE Conference on Evolutionary Computation. IEEE World Congress on Computational Intelligence.

[21]  K. Dejong,et al.  An analysis of the behavior of a class of genetic adaptive systems , 1975 .

[22]  P. Mellor,et al.  A Review of Job Shop Scheduling , 1966 .

[23]  Rajarshi Das,et al.  A Study of Control Parameters Affecting Online Performance of Genetic Algorithms for Function Optimization , 1989, ICGA.

[24]  J. A. Svestka,et al.  Rescheduling job shops under random disruptions , 1997 .

[25]  J. R. Brown,et al.  “Priority Class Scheduling: Production Scheduling for Multi-objective Environments , 1997 .

[26]  Marc H. J. Romanycia,et al.  What is a heuristic? , 1985 .

[27]  Harvey J. Greenberg,et al.  New approaches for heuristic search: A bilateral linkage with artificial intelligence , 1989 .

[28]  Fred Glover,et al.  Tabu Search: A Tutorial , 1990 .

[29]  Jian-Bo Yang,et al.  Multiple Attribute Decision Making , 1998 .

[30]  Hisao Ishibuchi,et al.  A multi-objective genetic local search algorithm and its application to flowshop scheduling , 1998, IEEE Trans. Syst. Man Cybern. Part C.

[31]  E.Stanley Lee,et al.  Fuzzy job sequencing for a flow shop , 1992 .

[32]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

[33]  Jatinder N. D. Gupta,et al.  Genetic algorithms for the two-stage bicriteria flowshop problem , 1996 .

[34]  Rong-Kwei Li,et al.  A NEW RESCHEDULING METHOD FOR COMPUTER-BASED SCHEDULING SYSTEMS , 1995 .

[35]  H. Ishibuchi,et al.  Local search algorithms for flow shop scheduling with fuzzy due-dates☆ , 1994 .

[36]  C. S. George Lee,et al.  An evolutionary approach to the job-shop scheduling problem , 1994, Proceedings of the 1994 IEEE International Conference on Robotics and Automation.

[37]  Ching-Fang Liaw,et al.  A hybrid genetic algorithm for the open shop scheduling problem , 2000, Eur. J. Oper. Res..

[38]  P. W. Poon,et al.  Genetic algorithm crossover operators for ordering applications , 1995, Comput. Oper. Res..

[39]  E. Lee,et al.  Ranking of fuzzy sets based on the concept of existence , 1994 .

[40]  Yuehwern Yih,et al.  A competitive neural network approach to multi-objective FMS scheduling , 1998 .

[41]  Peter Mertens,et al.  Combining knowledge-based systems and simulation to solve rescheduling problems , 1996, Decis. Support Syst..

[42]  Emanuel Falkenauer,et al.  A genetic algorithm for job shop , 1991, Proceedings. 1991 IEEE International Conference on Robotics and Automation.

[43]  Fred Glover,et al.  Tabu search methods for a single machine scheduling problem , 1991, J. Intell. Manuf..

[44]  R. F. Brown,et al.  PERFORMANCE EVALUATION , 2019, ISO 22301:2019 and business continuity management – Understand how to plan, implement and enhance a business continuity management system (BCMS).