The development of integrated planning and scheduling framework for dynamic and reactive environment of complex manufacturing problem

Flexible manufacturing system (FMS) is a manufacturing system in which there is some amount of flexibility which allows the system to react in the case of changes, whether predicted or unpredicted. Two major activities in manufacturing system are process planning and production scheduling. The current trends in present manufacturing industries require the ability to quickly integrate process plans for new orders into the existing production schedule to best accommodate the current load of the facility, the status of machines, and the availability of raw materials. The goal of this project is to propose an integrated planning and scheduling system for a flexible and complex manufacturing environment. Firstly, in Chapter 1, we give an overview of the real problem occurred in the field of dynamic scheduling. A hybrid genetic algorithm (HGA) for solving the dynamic job shop problem is proposed to solve the dynamic scheduling. Secondly, in Chapter 2 we described the modeling of the real world manufacturing processes using Petri Nets. We present two models of manufacturing process, namely machine model and process model. The goals of these models are to understand the behavior of the machine and to demonstrate the dynamic behavior of production processes, respectively. Next, multi-population directed genetic algorithms (MDGA) have been used to generate a number of optimal operation sequences for a real world manufacturing problem which is elaborated in Chapter 3. Then, in Chapter 4, a modified particle swarm optimization (MPSO) has been used to generate a feasible operation sequence for a real world manufacturing problem. Lastly, in Chapter 5, we investigate the problem of integrating new rush orders into the current schedule of a real world FMS. The aim is to introduce match up strategy with genetic algorithms (GA) that modify only part of the schedule in order to accommodate new arriving jobs.

[1]  Cerry M. Klein,et al.  A new rule for minimizing the number of tardy jobs in dynamic flow shops , 2004, Eur. J. Oper. Res..

[2]  Sigrid Knust,et al.  A tabu search algorithm for scheduling a single robot in a job-shop environment , 2002, Discret. Appl. Math..

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

[4]  Waldemar Kocjan.  Dynamic scheduling. State of the art report. , 2002 .

[5]  MengChu Zhou,et al.  Petri nets and industrial applications: A tutorial , 1994, IEEE Trans. Ind. Electron..

[6]  Andrew Y. C. Nee,et al.  Using genetic algorithms in process planning for job shop machining , 1997, IEEE Trans. Evol. Comput..

[7]  Jürgen Dorn,et al.  Case-based reactive scheduling , 1995 .

[8]  Khalil S. Hindi,et al.  A knowledge based job-shop scheduling system with controlled backtracking , 1993 .

[9]  M. Selim Akturk,et al.  Match-up scheduling under a machine breakdown , 1999, Eur. J. Oper. Res..

[10]  T. Glenn Bailey,et al.  A dynamic neighborhood based tabu search algorithm for real-world flight instructor scheduling problems , 2006, Eur. J. Oper. Res..

[11]  Kazuo Miyashita,et al.  CABINS: A Framework of Knowledge Acquisition and Iterative Revision for Schedule Improvement and Reactive Repair , 1995, Artif. Intell..

[12]  L. Darrell Whitley,et al.  A Comparison of Genetic Algorithms for the Static Job Shop Scheduling Problem , 2000, PPSN.

[13]  Alan A. Desrochers,et al.  Applications of Petri Nets in Manufacturing Systems: Modeling, Control, and Performance Analysis , 1994 .

[14]  Christian Bierwirth,et al.  Production Scheduling and Rescheduling with Genetic Algorithms , 1999, Evolutionary Computation.

[15]  Cheng-Jung Lin,et al.  Optimal operation planning and sequencing: minimization of tool changeovers , 1993 .

[16]  D. E. Goldberg,et al.  Genetic Algorithms in Search , 1989 .

[17]  R. Saravanan,et al.  Scheduling optimisation of flexible manufacturing systems using particle swarm optimisation algorithm , 2005 .

[18]  Nariman Sepehri,et al.  A computer-aided process planning model based on genetic algorithms , 1995, Comput. Oper. Res..

[19]  Ali M. S. Zalzala,et al.  Recent developments in evolutionary computation for manufacturing optimization: problems, solutions, and comparisons , 2000, IEEE Trans. Evol. Comput..

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

[21]  Vincent C. S. Wiers,et al.  The complexity of scheduling in practice , 1996 .

[22]  D. J. Smith,et al.  A Study of Permutation Crossover Operators on the Traveling Salesman Problem , 1987, ICGA.

[23]  Mikkel T. Jensen,et al.  Robust and Flexible Scheduling with Evolutionary Computation , 2001 .

[24]  Andrew Y. C. Nee,et al.  A simulated annealing-based optimization algorithm for process planning , 2000 .

[25]  Ihsan Sabuncuoglu,et al.  Analysis of reactive scheduling problems in a job shop environment , 2000, Eur. J. Oper. Res..

[26]  Sumitra Mukherjee,et al.  Evaluating particle swarm intelligence techniques for solving university examination timetabling problems , 2006 .

[27]  Bin Jiao,et al.  A similar particle swarm optimization algorithm for permutation flowshop scheduling to minimize makespan , 2006, Appl. Math. Comput..

[28]  Elizabeth Szelke,et al.  Knowledge-based reactive scheduling , 1994 .

[29]  Peter Ross,et al.  A Promising Genetic Algorithm Approach to Job-Shop SchedulingRe-Schedulingand Open-Shop Scheduling Problems , 1993, ICGA.

[30]  Alberto Gómez,et al.  A knowledge-based evolutionary strategy for scheduling problems with bottlenecks , 2003, Eur. J. Oper. Res..

[31]  Y Takeshi,et al.  GENETIC ALGORITHMS FOR JOB-SHOP SCHEDULING PROBLEMS , 1997 .

[32]  Abraham Mehrez,et al.  A methodology for knowledgebased scheduling decision support , 1992 .

[33]  Kenneth R. Currie,et al.  Development of an expert system for scheduling work content in a job shop environment , 1993 .

[34]  William E. Lorensen,et al.  Object-Oriented Modeling and Design , 1991, TOOLS.

[35]  Jeffrey W. Herrmann,et al.  Rescheduling Manufacturing Systems: A Framework of Strategies, Policies, and Methods , 2003, J. Sched..

[36]  Liang Gao,et al.  Particle swarm optimization based algorithm for machining parameter optimization , 2004, Fifth World Congress on Intelligent Control and Automation (IEEE Cat. No.04EX788).

[37]  Andrew Y. C. Nee,et al.  Application of genetic algorithm to computer-aided process planning in distributed manufacturing environments , 2005 .

[38]  Luis Rabelo,et al.  A real-world scheduling problem using genetic algorithms , 1995 .

[39]  Grady Booch,et al.  Object-Oriented Analysis and Design with Applications , 1990 .

[40]  John M. Usher,et al.  The application of genetic algorithms to operation sequencing for use in computer-aided process planning , 1996 .

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

[42]  R. Gary Parker.  Deterministic scheduling theory , 1995 .

[43]  Masatoshi Sakawa,et al.  Flexible scheduling in a machining center through genetic algorithms , 1996 .

[44]  Mikkel T. Jensen,et al.  Generating robust and flexible job shop schedules using genetic algorithms , 2003, IEEE Trans. Evol. Comput..

[45]  Dimitris Kiritsis,et al.  Search heuristics for operation sequencing in process planning , 2001 .

[46]  Jean-Pierre Kruth,et al.  A collaborative process planning and scheduling system , 1994 .

[47]  David E. Goldberg,et al.  Genetic Algorithms in Search Optimization and Machine Learning , 1988 .

[48]  Hsiao-Lan Fang,et al.  Genetic algorithms in timetabling and scheduling , 1995 .

[49]  Vivek Kumar Gupta,et al.  Operation sequencing using ant colony optimization technique , 2005, 2005 IEEE International Conference on Systems, Man and Cybernetics.

[50]  Erik D. Goodman,et al.  A Genetic Algorithm Approach to Dynamic Job Shop Scheduling Problem , 1997, ICGA.

[51]  H. L. Ong,et al.  A fast tabu search algorithm for the group shop scheduling problem , 2005, Adv. Eng. Softw..

[52]  Claude Le Pape,et al.  Adapting the behavior of a job-shop scheduling system , 1991, Decis. Support Syst..

[53]  Stefano Giordani,et al.  A tabu search approach for scheduling hazmat shipments , 2007, Comput. Oper. Res..

[54]  David E. Goldberg,et al.  Alleles, loci and the traveling salesman problem , 1985 .

[55]  Athanasios G. Mamalis,et al.  Determination of due dates in job shop scheduling by simulated annealing , 1996 .

[56]  Reha Uzsoy,et al.  Executing production schedules in the face of uncertainties: A review and some future directions , 2005, Eur. J. Oper. Res..

[57]  Yuan-Shin Lee,et al.  Sequencing parallel machining operations by genetic algorithms , 1999 .

[58]  M. J. Shah,et al.  Knowledge based dynamic scheduling in a steel plant , 1990, Sixth Conference on Artificial Intelligence for Applications.

[59]  Hsu-Pin Wang,et al.  Computer-Aided Process Planning , 1991 .

[60]  Shu-Chuan Chu,et al.  Timetable Scheduling Using Particle Swarm Optimization , 2006, First International Conference on Innovative Computing, Information and Control - Volume I (ICICIC'06).

[61]  Patrick R. McMullen,et al.  An ant colony optimization approach to addressing a JIT sequencing problem with multiple objectives , 2001, Artif. Intell. Eng..

[62]  Katsuhiko Takahashi,et al.  Simulated annealing approach for minimizing the makespan of the general job-shop , 1999 .

[63]  Albert Lee,et al.  Evaluation of ordering strategies for constraint satisfaction reactive scheduling , 1998, Decis. Support Syst..

[64]  Jacek Blazewicz,et al.  The job shop scheduling problem: Conventional and new solution techniques , 1996 .

[65]  Tadao Murata,et al.  Petri nets: Properties, analysis and applications , 1989, Proc. IEEE.

[66]  Puteh Saad,et al.  Incorporating constraint propagation in genetic algorithm for university timetable planning , 1999 .

[67]  Geetha Srinivasan,et al.  A genetic algorithm for job shop scheduling—a case study , 1996 .

[68]  Jaime Cerdá,et al.  Knowledge-based predictive and reactive scheduling in industrial environments , 2000 .

[69]  Reha Uzsoy,et al.  A genetic algorithm for minimizing maximum lateness on parallel identical batch processing machines with dynamic job arrivals and incompatible job families , 2007, Comput. Oper. Res..

[70]  Hua Chen,et al.  A knowledge-based dynamic job-scheduling in low-volume/high-variety manufacturing , 1999, Artif. Intell. Eng..

[71]  Reha Uzsoy,et al.  Exploiting shop floor status information to schedule complex job shops , 1994 .

[72]  Peter Cowling,et al.  Production, Manufacturing and Logistics Using real time information for effective dynamic scheduling , 2002 .

[73]  Christos Koulamas,et al.  Operation sequencing and machining economics , 1993 .

[74]  S. Kant Vajpayee,et al.  Principles of Computer Integrated Manufacturing , 1995 .

[75]  Christian Hestermann,et al.  A comparison between Operations Research-models and real world scheduling problems , 1997 .

[76]  Antonio Ramírez-Treviño,et al.  Petri net based control for the dynamic scheduling of a flexible manufacturing cell , 1998, SMC'98 Conference Proceedings. 1998 IEEE International Conference on Systems, Man, and Cybernetics (Cat. No.98CH36218).

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

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

[79]  Mauricio G. C. Resende,et al.  Discrete Optimization A hybrid genetic algorithm for the job shop scheduling problem , 2005 .

[80]  Michael Affenzeller,et al.  Applying Genetic Algorithms to the Optimization of Production Planning in a Real-World Manufacturing Environment , 2007 .

[81]  A. J. Clewett,et al.  Introduction to sequencing and scheduling , 1974 .

[82]  Lawrence Davis,et al.  Applying Adaptive Algorithms to Epistatic Domains , 1985, IJCAI.

[83]  Klaus H. Ecker,et al.  Scheduling Computer and Manufacturing Processes , 2001 .

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