Integration of production planning and scheduling using an expert system and a genetic algorithm

In the traditional approaches, processes of planning and scheduling are done sequentially, where the process plan is determined before the actual scheduling is performed. This simple approach ignores the relationship between the scheduling and planning. Practical scheduling systems need to be able to react to significant real-time events within an acceptable response time and revise schedules appropriately. Therefore, the author proposes a new methodology with artificial intelligence to support production planning and scheduling in supply net. In this approach, the production planning problem is first solved, and then the scheduling problem is considered with the constraint of the solution. The approach is implemented as a combination of expert system and genetic algorithm. The research indicates that the new system yields better results in real-life supply net than using a traditional method. The results of experiments provide that the proposed genetic algorithm produces schedules with makespan that is average 21% better than the methods based on dispatching rules.

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

[2]  David F. Percy,et al.  Determining economical maintenance intervals , 2000 .

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

[4]  Dk Smith,et al.  Simulated annealing for the permutation flowshop problem , 1991 .

[5]  Roberto Tadei,et al.  An improved branch-and-bound algorithm for the two machine total completion time flow shop problem , 2002, Eur. J. Oper. Res..

[6]  Jatinder N. D. Gupta,et al.  Local search heuristics for two-stage flow shop problems with secondary criterion , 2002, Comput. Oper. Res..

[7]  S. C. Lenny Koh,et al.  Managing uncertainty in ERP-controlled manufacturing environments in SMEs , 2006 .

[8]  Botond Kádár,et al.  Hierarchy in distributed shop floor control , 2000 .

[9]  Can Akkan,et al.  The two-machine flowshop total completion time problem: Improved lower bounds and a branch-and-bound algorithm , 2004, Eur. J. Oper. Res..

[10]  William L. Maxwell,et al.  Theory of scheduling , 1967 .

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

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

[13]  John H. Holland,et al.  Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence , 1992 .

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

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

[16]  A. Lawrynowicz,et al.  Integration of production planning and scheduling using an expert system and a genetic algorithm , 2008, J. Oper. Res. Soc..

[17]  Goldberg,et al.  Genetic algorithms , 1993, Robust Control Systems with Genetic Algorithms.

[18]  Jose M. Framiñan,et al.  A review and classification of heuristics for permutation flow-shop scheduling with makespan objective , 2004, J. Oper. Res. Soc..

[19]  Jong Woo Kim,et al.  Heuristic knowledge representation of production scheduling: An integrated modeling approach , 1996 .

[20]  Tamás Kis,et al.  Project scheduling approach to production planning , 2003 .

[21]  R Knosala,et al.  A production scheduling problem using genetic algorithm , 2001 .