Review of job shop scheduling research and its new perspectives under Industry 4.0

Traditional job shop scheduling is concentrated on centralized scheduling or semi-distributed scheduling. Under the Industry 4.0, the scheduling should deal with a smart and distributed manufacturing system supported by novel and emerging manufacturing technologies such as mass customization, Cyber-Physics Systems, Digital Twin, and SMAC (Social, Mobile, Analytics, Cloud). The scheduling research needs to shift its focus to smart distributed scheduling modeling and optimization. In order to transferring traditional scheduling into smart distributed scheduling (SDS), we aim to answer two questions: (1) what traditional scheduling methods and techniques can be combined and reused in SDS and (2) what are new methods and techniques required for SDS. In this paper, we first review existing researches from over 120 papers and answer the first question and then we explore a future research direction in SDS and discuss the new techniques for developing future new JSP scheduling models and constructing a framework on solving the JSP problem under Industry 4.0.

[1]  F. Fnaiech,et al.  New Hopfield Neural Network for joint Job Shop Scheduling of production and maintenance , 2012, IECON 2012 - 38th Annual Conference on IEEE Industrial Electronics Society.

[2]  Banu Çalis,et al.  A research survey: review of AI solution strategies of job shop scheduling problem , 2013, Journal of Intelligent Manufacturing.

[3]  Thatchai Thepphakorn,et al.  Application of Firefly Algorithm and Its Parameter Setting for Job Shop Scheduling , 2012 .

[4]  Mitsuo Gen,et al.  Network modeling and evolutionary optimization for scheduling in manufacturing , 2012, J. Intell. Manuf..

[5]  F. A. R. U K G E Y,et al.  The Strategies and Parameters of Tabu Search for Job-shop Scheduling , 2004 .

[6]  Richard F. Hartl,et al.  An improved Ant System algorithm for theVehicle Routing Problem , 1999, Ann. Oper. Res..

[7]  Krzysztof R. Apt,et al.  Principles of constraint programming , 2003 .

[8]  Mostafa Zandieh,et al.  Flexible job shop scheduling under condition-based maintenance: Improved version of imperialist competitive algorithm , 2017, Appl. Soft Comput..

[9]  J. K. Lenstra,et al.  Local Search in Combinatorial Optimisation. , 1997 .

[10]  Song Huang,et al.  Particle swarm optimization with variable neighborhood search for multiobjective flexible job shop scheduling problem , 2016, Int. J. Model. Simul. Sci. Comput..

[11]  S. M. Johnson,et al.  Optimal two- and three-stage production schedules with setup times included , 1954 .

[12]  Nabil A. Kartam,et al.  An artificial neural network for resource leveling problems , 1998, Artificial Intelligence for Engineering Design, Analysis and Manufacturing.

[13]  Peter Brucker,et al.  Job-shop Scheduling Problem , 2009, Encyclopedia of Optimization.

[14]  Alper Hamzadayi,et al.  Testing the performance of teaching-learning based optimization (TLBO) algorithm on combinatorial problems: Flow shop and job shop scheduling cases , 2014, Inf. Sci..

[15]  R. Storn,et al.  Differential Evolution - A simple and efficient adaptive scheme for global optimization over continuous spaces , 2004 .

[16]  Lijun Yang,et al.  Job Shop Scheduling based on Improved Discrete Particle Swarm Optimization , 2015, IEEM 2015.

[17]  W. Zhang,et al.  Multi-Objective Scheduling Simulation of Flexible Job-Shop Based on Multi-Population Genetic Algorithm , 2017 .

[18]  Arit Thammano,et al.  A new algorithm for flexible job-shop scheduling problem based on particle swarm optimization , 2015, Artificial Life and Robotics.

[19]  F. Glover,et al.  In Modern Heuristic Techniques for Combinatorial Problems , 1993 .

[20]  Yuehwern Yih,et al.  Selection of dispatching rules on multiple dispatching decision points in real-time scheduling of a semiconductor wafer fabrication system , 2003 .

[21]  Z. A. Lomnicki A “Branch-and-Bound” Algorithm for the Exact Solution of the Three-Machine Scheduling Problem , 1965 .

[22]  Haidar M. Harmanani,et al.  An Efficient Method for the Open-Shop Scheduling Problem Using Simulated Annealing , 2016 .

[23]  Abdelghani Bekrar,et al.  Multiple priority dispatching rules for the job shop scheduling problem , 2015, 2015 3rd International Conference on Control, Engineering & Information Technology (CEIT).

[24]  Malcolm Yoke-Hean Low,et al.  A Bee Colony Optimization Algorithm to Job Shop Scheduling , 2006, Proceedings of the 2006 Winter Simulation Conference.

[25]  Christian Blum,et al.  An Ant Colony Optimization Algorithm for Shop Scheduling Problems , 2004, J. Math. Model. Algorithms.

[26]  Raymond Chiong,et al.  Solving the energy-efficient job shop scheduling problem: a multi-objective genetic algorithm with enhanced local search for minimizing the total weighted tardiness and total energy consumption , 2016 .

[27]  Mehrdad Tamiz,et al.  Multi-objective meta-heuristics: An overview of the current state-of-the-art , 2002, Eur. J. Oper. Res..

[28]  Antonin Ponsich,et al.  A hybrid Differential Evolution - Tabu Search algorithm for the solution of Job-Shop Scheduling Problems , 2013, Appl. Soft Comput..

[29]  Stephen C. Graves,et al.  A Review of Production Scheduling , 1981, Oper. Res..

[30]  Mariappan Kadarkarainadar Marichelvam,et al.  A hybrid discrete firefly algorithm to solve flow shop scheduling problems to minimise total flow time , 2016, Int. J. Bio Inspired Comput..

[31]  Slawomir Zak,et al.  Firefly Algorithm for Continuous Constrained Optimization Tasks , 2009, ICCCI.

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

[33]  Yoshiyasu Takefuji,et al.  Stochastic neural networks for solving job-shop scheduling. I. Problem representation , 1988, IEEE 1988 International Conference on Neural Networks.

[34]  S. Meeran,et al.  A hybrid genetic tabu search algorithm for solving job shop scheduling problems: a case study , 2011, Journal of Intelligent Manufacturing.

[35]  Aihua Yin,et al.  An improved shifting bottleneck procedure for the job shop scheduling problem , 2004, Comput. Oper. Res..

[36]  Toby Walsh,et al.  Handbook of Constraint Programming , 2006, Handbook of Constraint Programming.

[37]  Inyong Ham,et al.  A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem , 1983 .

[38]  Hülya Güçdemir,et al.  Customer centric production planning and control in job shops: A simulation optimization approach ☆ , 2017 .

[39]  Mohammad Kazem Sayadia,et al.  A discrete firefly metaheuristic with local search for makespan minimization in permutation flow shop scheduling problems , 2010 .

[40]  A. Rajkumar,et al.  Hybridization of Artificial Bee Colony algorithm with Particle Swarm Optimization algorithm for flexible Job Shop Scheduling , 2016, 2016 International Conference on Energy Efficient Technologies for Sustainability (ICEETS).

[41]  Riccardo Poli,et al.  Particle swarm optimization , 1995, Swarm Intelligence.

[42]  Doreen Meier,et al.  Fundamentals Of Neural Networks Architectures Algorithms And Applications , 2016 .

[43]  Egon Balas,et al.  Guided Local Search with Shifting Bottleneck for Job Shop Scheduling , 1998 .

[44]  Tom Page,et al.  A hybrid discrete firefly algorithm for solving multi-objective flexible job shop scheduling problems , 2015, Int. J. Bio Inspired Comput..

[45]  Marco Dorigo,et al.  Distributed Optimization by Ant Colonies , 1992 .

[46]  Rong-Hwa Huang,et al.  An effective ant colony optimization algorithm for multi-objective job-shop scheduling with equal-size lot-splitting , 2017, Appl. Soft Comput..

[47]  Emin Gundogar,et al.  Fuzzy priority rule for job shop scheduling , 2004, J. Intell. Manuf..

[48]  Christodoulos A. Floudas,et al.  Mixed Integer Linear Programming in Process Scheduling: Modeling, Algorithms, and Applications , 2005, Ann. Oper. Res..

[49]  Ahmed Chiheb Ammari,et al.  An effective and distributed particle swarm optimization algorithm for flexible job-shop scheduling problem , 2015, Journal of Intelligent Manufacturing.

[50]  Vladimir Cretu,et al.  EFFICIENT GENERATION OF NEAR OPTIMAL INITIAL POPULATIONS TO ENHANCE GENETIC ALGORITHMS FOR JOB-SHOP SCHEDULING , 2010 .

[51]  Ching-Jong Liao,et al.  Ant colony optimization combined with taboo search for the job shop scheduling problem , 2008, Comput. Oper. Res..

[52]  Li-Chen Fu,et al.  Multi-agent based dynamic scheduling for a flexible assembly system , 1998, Proceedings. 1998 IEEE International Conference on Robotics and Automation (Cat. No.98CH36146).

[53]  Lei Wang,et al.  Flexible Job Shop Scheduling Problem Using an Improved Ant Colony Optimization , 2017, Sci. Program..

[54]  H. Van Dyke Parunak,et al.  Fractal Actors for Distributed Manufacturing Control , 1985, CAIA.

[55]  Egon Balas,et al.  The Shifting Bottleneck Procedure for Job Shop Scheduling , 1988 .

[56]  Jeffrey R. Barker,et al.  Scheduling the General Job-Shop , 1985 .

[57]  Lian Lian,et al.  Comparative Study of Heuristics Algorithms in Solving Flexible Job Shop Scheduling Problem with Condition Based Maintenance , 2014 .

[58]  Norman M. Sadeh,et al.  Variable and Value Ordering Heuristics for the Job Shop Scheduling Constraint Satisfaction Problem , 1996, Artif. Intell..

[59]  Sheik Meeran,et al.  A State-of-the-art Review of Job-Shop Scheduling Techniques , 2017 .

[60]  Erhan Kozan,et al.  A hybrid shifting bottleneck procedure algorithm for the parallel-machine job-shop scheduling problem , 2012, J. Oper. Res. Soc..

[61]  Manuel Laguna,et al.  Tabu Search , 1997 .

[62]  Lawrence Davis,et al.  Job Shop Scheduling with Genetic Algorithms , 1985, ICGA.

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

[64]  Daniel J. Rosenkrantz,et al.  An Analysis of Several Heuristics for the Traveling Salesman Problem , 1977, SIAM J. Comput..

[65]  Christian Blum,et al.  Beam-ACO - hybridizing ant colony optimization with beam search: an application to open shop scheduling , 2005, Comput. Oper. Res..

[66]  I. Adiri,et al.  An Efficient Optimal Algorithm for the Two-Machines Unit-Time Jobshop Schedule-Length Problem , 1982, Math. Oper. Res..

[67]  Rainer Storn,et al.  Differential Evolution – A Simple and Efficient Heuristic for global Optimization over Continuous Spaces , 1997, J. Glob. Optim..

[68]  Kun Chen,et al.  Two-generation Pareto ant colony algorithm for multi-objective job shop scheduling problem with alternative process plans and unrelated parallel machines , 2015, Journal of Intelligent Manufacturing.

[69]  Ulrich A. W. Tetzlaff,et al.  Constraint Propagation Based Scheduling of Job Shops , 1996, INFORMS J. Comput..

[70]  Ahmed Chiheb Ammari,et al.  Two stage particle swarm optimization to solve the flexible job shop predictive scheduling problem considering possible machine breakdowns , 2017, Comput. Ind. Eng..

[71]  Boris Otto,et al.  Design Principles for Industrie 4.0 Scenarios , 2016, 2016 49th Hawaii International Conference on System Sciences (HICSS).

[72]  Yasuhiro Tsujimura,et al.  A tutorial survey of job-shop scheduling problems using genetic algorithms, part II: hybrid genetic search strategies , 1999 .

[73]  Fred W. Glover,et al.  Future paths for integer programming and links to artificial intelligence , 1986, Comput. Oper. Res..

[74]  Rei Hino,et al.  Decentralized Job Shop Scheduling by Recursive Propagation Method. , 2000 .

[75]  Ravi Sethi,et al.  The Complexity of Flowshop and Jobshop Scheduling , 1976, Math. Oper. Res..

[76]  Rong-Hwa Huang,et al.  Flexible job shop scheduling with due window—a two-pheromone ant colony approach , 2013 .

[77]  Frank Werner,et al.  On the application of insertion techniques for job shop problems with setup times , 1999, RAIRO Oper. Res..

[78]  Mostafa Zandieh,et al.  Multi-objective scheduling of dynamic job shop using variable neighborhood search , 2010, Expert Syst. Appl..

[79]  L. F. Perrone A BEE COLONY OPTIMIZATION ALGORITHM TO JOB SHOP SCHEDULING , 2006 .

[80]  Zhiming Wu,et al.  An effective hybrid optimization approach for multi-objective flexible job-shop scheduling problems , 2005, Comput. Ind. Eng..

[81]  Lin Lin,et al.  Multiobjective evolutionary algorithm for manufacturing scheduling problems: state-of-the-art survey , 2014, J. Intell. Manuf..

[82]  Laurene V. Fausett,et al.  Fundamentals Of Neural Networks , 1994 .

[83]  M. Sayadi,et al.  A discrete firefly meta-heuristic with local search for makespan minimization in permutation flow shop scheduling problems , 2010 .

[84]  Frank Werner,et al.  Insertion Techniques for the Heuristic Solution of the Job Shop Problem , 1995, Discret. Appl. Math..

[85]  Xin-She Yang,et al.  A Discrete Firefly Algorithm for the Multi-Objective Hybrid Flowshop Scheduling Problems , 2014, IEEE Transactions on Evolutionary Computation.

[86]  GenMitsuo,et al.  Network modeling and evolutionary optimization for scheduling in manufacturing , 2012 .

[87]  Christodoulos A. Floudas,et al.  Continuous-time versus discrete-time approaches for scheduling of chemical processes: a review , 2004, Comput. Chem. Eng..

[88]  P. Senthil Kumar,et al.  Hybrid Sorting Immune Simulated Annealing Algorithm For Flexible Job Shop Scheduling , 2014, Int. J. Comput. Intell. Syst..

[89]  Thomas E. Morton,et al.  Heuristic scheduling systems : with applications to production systems and project management , 1993 .

[90]  Daniel J. Fonseca,et al.  Artificial neural networks for job shop simulation , 2002, Adv. Eng. Informatics.

[91]  Stéphane Dauzère-Pérès,et al.  A modified shifting bottleneck procedure for job-shop scheduling , 1993 .

[92]  Marco Dorigo,et al.  Optimization, Learning and Natural Algorithms , 1992 .

[93]  Antonin Ponsich,et al.  Solving Permutation Problems with Differential Evolution: An Application to the Jobshop Scheduling Problem , 2009, 2009 Ninth International Conference on Intelligent Systems Design and Applications.

[94]  Pingyu Jiang,et al.  Manifold learning based rescheduling decision mechanism for recessive disturbances in RFID-driven job shops , 2016, Journal of Intelligent Manufacturing.

[95]  Peng Wang,et al.  A Knowledge-Based Ant Colony Optimization for Flexible Job Shop Scheduling Problems , 2010, Appl. Soft Comput..

[96]  Harvey M. Wagner,et al.  An integer linear‐programming model for machine scheduling , 1959 .

[97]  Nobuhiro Sugimura,et al.  A study on real-time scheduling for autonomous distributed manufacturing systems , 2010, 2010 IEEE International Conference on Systems, Man and Cybernetics.

[98]  Derya Eren Akyol,et al.  A review on evolution of production scheduling with neural networks , 2007, Comput. Ind. Eng..

[99]  T. C. Edwin Cheng,et al.  A tabu search/path relinking algorithm to solve the job shop scheduling problem , 2014, Comput. Oper. Res..

[100]  Zhiqiang Jiang,et al.  A Chaotic Differential Evolution Algorithm for Flexible Job Shop Scheduling , 2016 .

[101]  Parviz Fattahi,et al.  A mathematical model and genetic algorithm to cyclic flexible job shop scheduling problem , 2015, J. Intell. Manuf..

[102]  Xin-She Yang,et al.  Nature-Inspired Metaheuristic Algorithms , 2008 .

[103]  Hartmut Schmeck,et al.  Ant colony optimization for resource-constrained project scheduling , 2000, IEEE Trans. Evol. Comput..

[104]  Chris N. Potts,et al.  A Branch and Bound Algorithm for the Total Weighted Tardiness Problem , 1985, Oper. Res..

[105]  Robert Harrison,et al.  Engineering the smart factory , 2016, Chinese Journal of Mechanical Engineering.

[106]  Thomas Philip Runarsson,et al.  Supervised Learning Linear Priority Dispatch Rules for Job-Shop Scheduling , 2011, LION.

[107]  Xinyu Li,et al.  An effective hybrid genetic algorithm and tabu search for flexible job shop scheduling problem , 2016 .

[108]  Francesca Rossi,et al.  Constraint satisfaction techniques in planning and scheduling , 2010, J. Intell. Manuf..

[109]  R. Sridharan,et al.  A multi-objective decision-making framework using preference selection index for assembly job shop scheduling problem , 2016 .

[110]  Graham McMahon,et al.  On Scheduling with Ready Times and Due Dates to Minimize Maximum Lateness , 1975, Oper. Res..

[111]  S. Sarin,et al.  An improved branching scheme for the branch and bound procedure of scheduling n jobs on m parallel machines to minimize total weighted flowtime , 1988 .

[112]  Mohammad Saidi-Mehrabad,et al.  An Ant Colony Algorithm (ACA) for solving the new integrated model of job shop scheduling and conflict-free routing of AGVs , 2015, Comput. Ind. Eng..

[113]  Moacir Godinho Filho,et al.  Literature review regarding Ant Colony Optimization applied to scheduling problems: Guidelines for implementation and directions for future research , 2013, Eng. Appl. Artif. Intell..

[114]  G. Rand Sequencing and Scheduling: An Introduction to the Mathematics of the Job-Shop , 1982 .

[115]  Fuqing Zhao,et al.  A hybrid differential evolution and estimation of distribution algorithm based on neighbourhood search for job shop scheduling problems , 2016 .

[116]  Masatoshi Sakawa,et al.  Fuzzy programming for multiobjective job shop scheduling with fuzzy processing time and fuzzy duedate through genetic algorithms , 2000, Eur. J. Oper. Res..

[117]  Per Brinch Hansen,et al.  Design principles , 2002 .

[118]  H. Kagermann Change Through Digitization—Value Creation in the Age of Industry 4.0 , 2015 .

[119]  Valery A. Kostenko,et al.  Simulated Annealing Algorithm for Job Shop Scheduling on Reliable Real-Time Systems , 2014, ICORES.

[120]  James C. Chen,et al.  Flexible job shop scheduling with parallel machines using Genetic Algorithm and Grouping Genetic Algorithm , 2012, Expert Syst. Appl..

[121]  A. S. Xanthopoulos,et al.  Cluster analysis and neural network-based metamodeling of priority rules for dynamic sequencing , 2018, J. Intell. Manuf..

[122]  Siba Sankar Mahapatra,et al.  A quantum behaved particle swarm optimization for flexible job shop scheduling , 2016, Comput. Ind. Eng..