Machine scheduling in custom furniture industry through neuro-evolutionary hybridization

Machine scheduling is a critical problem in industries where products are custom-designed. The wide range of products, the lack of previous experiences in manufacturing, and the several conflicting criteria used to evaluate the quality of the schedules define a huge search space. Furthermore, production complexity and human influence in each manufacturing step make time estimations difficult to obtain thus reducing accuracy of schedules. The solution described in this paper combines evolutionary computing and neural networks to reduce the impact of (i) the huge search space that the multi-objective optimization must deal with and (ii) the inherent problem of computing the processing times in a domain like custom manufacturing. Our hybrid approach obtains near optimal schedules through the Non-dominated Sorting Genetic Algorithm II (NSGA-II) combined with time estimations based on multilayer perceptron neural networks.

[1]  H. Eskandari,et al.  A fast Pareto genetic algorithm approach for solving expensive multiobjective optimization problems , 2008, J. Heuristics.

[2]  Carlos Alberto,et al.  Genetic Algorithms for Shop-scheduling Problems : Partial Enumeration and Stochastic Heuristics , 2001 .

[3]  Sheik Meeran,et al.  Deterministic job-shop scheduling: Past, present and future , 1999, Eur. J. Oper. Res..

[4]  Jouni Lampinen,et al.  GDE3: the third evolution step of generalized differential evolution , 2005, 2005 IEEE Congress on Evolutionary Computation.

[5]  Jeffrey W. Herrmann,et al.  Reducing throughput time during product design , 2001 .

[6]  Li-Ning Xing,et al.  Multi-objective flexible job shop schedule: Design and evaluation by simulation modeling , 2009, Appl. Soft Comput..

[7]  Qidong Cao,et al.  Reexamination of processing time uncertainty , 2005, Eur. J. Oper. Res..

[8]  David E. Goldberg,et al.  A niched Pareto genetic algorithm for multiobjective optimization , 1994, Proceedings of the First IEEE Conference on Evolutionary Computation. IEEE World Congress on Computational Intelligence.

[9]  Francisco Luna,et al.  jMetal: a Java Framework for Developing Multi-Objective Optimization Metaheuristics , 2006 .

[10]  P. Aravindan,et al.  Comparative evaluation of genetic algorithms for job-shop scheduling , 2001 .

[11]  Sam Kwong,et al.  An Evolutionary Approach for Solving the Multi-Objective Job-Shop Scheduling Problem , 2007, Evolutionary Scheduling.

[12]  HamadaKazuro,et al.  Hybridizing a Genetic Algorithm with Rule-Based Reasoning for Production Planning , 1995 .

[13]  Kalyanmoy Deb,et al.  A fast and elitist multiobjective genetic algorithm: NSGA-II , 2002, IEEE Trans. Evol. Comput..

[14]  Gary B. Lamont,et al.  Evolutionary Algorithms for Solving Multi-Objective Problems (Genetic and Evolutionary Computation) , 2006 .

[15]  Jae Kyu Lee,et al.  Developing scheduling systems for Daewoo Shipbuilding: DAS project , 1997 .

[16]  E. Nowicki,et al.  A Fast Taboo Search Algorithm for the Job Shop Problem , 1996 .

[17]  Martin J. Oates,et al.  PESA-II: region-based selection in evolutionary multiobjective optimization , 2001 .

[18]  Peter Brucker,et al.  A Branch and Bound Algorithm for the Job-Shop Scheduling Problem , 1994, Discret. Appl. Math..

[19]  Leon Sterling,et al.  AI '92 : proceedings of the 5th Australian Joint Conference on Artificial Intelligence : Hobart, Tasmania, 16-18 November 1992 , 1992 .

[20]  Pei-Chann Chang,et al.  Adaptive multi-objective genetic algorithms for scheduling of drilling operation in printed circuit board industry , 2007, Appl. Soft Comput..

[21]  Kazuhiko Kawamura,et al.  Managing genetic search in job shop scheduling , 1993, IEEE Expert.

[22]  Stephen I. Gallant,et al.  Perceptron-based learning algorithms , 1990, IEEE Trans. Neural Networks.

[23]  Rjm Rob Vaessens.  Generalized job shop scheduling : complexity and local search , 1995 .

[24]  Peigen Li,et al.  A very fast TS/SA algorithm for the job shop scheduling problem , 2008, Comput. Oper. Res..

[25]  Marco Laumanns,et al.  SPEA2: Improving the strength pareto evolutionary algorithm , 2001 .

[26]  Pierre Borne,et al.  EVOLUTIONARY ALGORITHMS FOR JOB-SHOP SCHEDULING , 2004 .

[27]  Gerhard Widmer,et al.  Proceedings of the 9th European Conference on Machine Learning , 1997 .

[28]  Anders Bjerg Pedersen,et al.  A Fast Taboo Search Algorithm for the Job Shop Scheduling Problem , 2008 .

[29]  Andrew Kusiak,et al.  Design of components for schedulability , 1994 .

[30]  Carlos A. Coello Coello,et al.  Recent Trends in Evolutionary Multiobjective Optimization , 2005, Evolutionary Multiobjective Optimization.

[31]  Yoke San Wong,et al.  Job Shop Scheduling with Dynamic Fuzzy Selection of Dispatching Rules , 2000 .

[32]  Pierre Borne,et al.  Ant systems & Local Search Optimization for flexible Job Shop Scheduling Production , 2007, Int. J. Comput. Commun. Control.

[33]  Jan Karel Lenstra,et al.  Job Shop Scheduling by Simulated Annealing , 1992, Oper. Res..

[34]  Peter Ross,et al.  Evolutionary Scheduling: A Review , 2005, Genetic Programming and Evolvable Machines.

[35]  C. Fonseca,et al.  GENETIC ALGORITHMS FOR MULTI-OBJECTIVE OPTIMIZATION: FORMULATION, DISCUSSION, AND GENERALIZATION , 1993 .

[36]  Chandrasekharan Rajendran,et al.  Scheduling in flowshop and cellular manufacturing systems with multiple objectives— a genetic algorithmic approach , 1996 .

[37]  Bertrand M. T. Lin,et al.  A concise survey of scheduling with time-dependent processing times , 2004, Eur. J. Oper. Res..

[38]  J. Carlier,et al.  An algorithm for solving the job-shop problem , 1989 .

[39]  Luca Maria Gambardella,et al.  Effective Neighborhood Functions for the Flexible Job Shop Problem , 1998 .

[40]  Carla Seatzu,et al.  Job-shop scheduling models with set-up times , 2002, IEEE International Conference on Systems, Man and Cybernetics.

[41]  Martin J. Oates,et al.  The Pareto Envelope-Based Selection Algorithm for Multi-objective Optimisation , 2000, PPSN.

[42]  Dvir Shabtay,et al.  A survey of scheduling with controllable processing times , 2007, Discret. Appl. Math..

[43]  Johann L. Hurink,et al.  Tabu search for the job-shop scheduling problem with multi-purpose machines , 1994 .

[44]  N. Jawahar,et al.  A multiobjective genetic algorithm for job shop scheduling , 2001 .

[45]  L. Jain,et al.  Evolutionary multiobjective optimization : theoretical advances and applications , 2005 .

[46]  Shigeo Abe,et al.  A genetic algorithm approach to multi-objective scheduling problems with earliness and tardiness penalties , 1999, Proceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406).

[47]  Jan Karel Lenstra,et al.  A Computational Study of Local Search Algorithms for Job Shop Scheduling , 1994, INFORMS J. Comput..

[48]  Ling Li,et al.  Using MLP networks to design a production scheduling system , 2003, Comput. Oper. Res..

[49]  Manuel Mucientes,et al.  Processing time estimations by variable structure TSK rules learned through genetic programming , 2008, Soft Comput..

[50]  Lothar Thiele,et al.  Multiobjective evolutionary algorithms: a comparative case study and the strength Pareto approach , 1999, IEEE Trans. Evol. Comput..

[51]  Jesús Alcalá-Fdez,et al.  Local identification of prototypes for genetic learning of accurate TSK fuzzy rule-based systems: Research Articles , 2007 .

[52]  Egon Balas,et al.  Job shop scheduling with setup times, deadlines and precedence constraints , 2008, J. Sched..

[53]  Dana S. Nau,et al.  Systematic approach to analysing the manufacturability of machined parts , 1995, Comput. Aided Des..

[54]  L. Darrell Whitley,et al.  Problem difficulty for tabu search in job-shop scheduling , 2003, Artif. Intell..

[55]  Ioannis Minis,et al.  A generative approach for concurrent manufacturability evaluation and subcontractor selection , 1999 .

[56]  Peter J. Fleming,et al.  Genetic Algorithms for Multiobjective Optimization: FormulationDiscussion and Generalization , 1993, ICGA.

[57]  Alice E. Smith,et al.  Integrating an Expert System And a Neural Network for Process Planning , 1998 .

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

[59]  Geoffrey Boothroyd,et al.  Product design for manufacture and assembly , 1994, Comput. Aided Des..

[60]  María José del Jesús,et al.  KEEL: a software tool to assess evolutionary algorithms for data mining problems , 2008, Soft Comput..

[61]  Ian H. Witten,et al.  Induction of model trees for predicting continuous classes , 1996 .

[62]  Jesús Alcalá-Fdez,et al.  Local identification of prototypes for genetic learning of accurate TSK fuzzy rule‐based systems , 2007, Int. J. Intell. Syst..

[63]  S. Binato,et al.  A GRASP FOR JOB SHOP SCHEDULING , 2001 .

[64]  Satyandra K. Gupta,et al.  A systematic approach for analyzing the manufacturability of machined parts , 1993 .

[65]  Deming Lei,et al.  Crowding-measure-based multiobjective evolutionary algorithm for job shop scheduling , 2006 .

[66]  Ken-ichi Sato,et al.  Hybridizing a Genetic Algorithm with Rule-Based Reasoning for Production Planning , 1995, IEEE Expert.

[67]  Martin Fodslette Møller,et al.  A scaled conjugate gradient algorithm for fast supervised learning , 1993, Neural Networks.

[68]  Mark S. Fox,et al.  Intelligent Scheduling , 1998 .

[69]  Jürgen Branke,et al.  Anticipation in Dynamic Optimization: The Scheduling Case , 2000, PPSN.

[70]  J. Rustagi.  Optimization Techniques in Statistics , 1994 .

[71]  David W. Corne,et al.  Approximating the Nondominated Front Using the Pareto Archived Evolution Strategy , 2000, Evolutionary Computation.

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

[73]  G. Thompson,et al.  Algorithms for Solving Production-Scheduling Problems , 1960 .

[74]  Gary B. Lamont,et al.  Evolutionary Algorithms for Solving Multi-Objective Problems , 2002, Genetic Algorithms and Evolutionary Computation.

[75]  Robert H. Storer,et al.  Robustness Measures and Robust Scheduling for Job Shops , 1994 .

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

[77]  J. R. Quinlan.  Learning With Continuous Classes , 1992 .