Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
References
Akkan C and Karabati S (2004). The two-machine flowshop total completion time problem: Improved lower bounds and a branch-and-bound algorithm. Eur J Opl Res 154: 420–429.
Błażewicz J, Domschke W and Pesch E (1996). The job shop scheduling problem: Conventional and new solution techniques. Eur J Opl Res 93: 1–33.
Bongaerts L, Monostori L, McFarlane D and Kádár B (2000). Hierarchy in distributed shop floor control. Comp Ind 43: 123–137.
Cheng R, Gen M and Tsujimura Y (1996). A tutorial survey of job-shop scheduling problems using genetic algorithms part 1. Representation Comp Ind Eng 4: 983–997.
Conway RN, Maxwell WL and Miller LW (1967). Theory of Scheduling. Addison Wesley: Reading, MA.
Cowling P and Johansson M (2002). Using real time information for effective dynamic scheduling. Eur J Opl Res 139: 230–244.
Della Croce F, Ghirardi M and Tadei R (2002). An improved branch and bound algorithm for the two-machine total completion time flowshop problem. Eur J Opl Res 139: 293–301.
Framinan JM, Gupta JND and Leisten R (2004). A review and classification of heuristics for permutation flowshop scheduling with makespan objective. J Opl Res Soc 55: 1243–1255.
Goldberg DE (1989). Genetic Algorithms in Search, Optimization, and Machine Learning. Addison Wesley: Reading, MA.
Goldberg DR and Lingle R (1985). Alleles loci and the travelling salesman problem. In: Hillsdale N.J. and Grefenstette J.J. (eds). Proceedings of the First International Conference on Genetic Algorithms. Lawrence Erlbaum Associates: Hillsdale, NJ, pp. 154–159.
Gupta JND, Hennig K and Werner F (2002). Local search heuristics for two stage flow shop problems with secondary criterion. Comput Opl Res 29: 123–149.
Holland J (1975). Adaptation in Natural and Artificial Systems. University of Michigan Press: Ann Arbor.
Knosala R and Wal T (2001). A production scheduling problem using genetic algorithm. J Mater Process Technol 109: 90–95.
Koh SCL and Saad SM (2006). Managing uncertainty in ERP-controlled manufacturing environments in SMEs. Int J Prod Econ 101: 109–127.
Kumar NSH and Srinivasan G (1996). A genetic algorithm for job shop scheduling—A case study. Comp Ind 31: 155–160.
Ławrynowicz A (2004). Combination of expert system and genetic algorithm for job shop planning and scheduling. In: Kot A. (ed). Proceedings of 5th International Carpathian Control Conference. Faculty of Mechanical Engineering and Robotics AGH—University of Science and Technology: Krakow, Poland, pp. 943–948.
Ławrynowicz A (2005). Integration of production planning and scheduling using expert system and genetic algorithm. In: Proceedings of the Third European Conference on Intelligent Management Systems in Operations. The OR Society: Birmingham, UK, pp. 33–42.
Márkus A, Váncza J, Kis T and Kovács A (2003). Project scheduling approach to production planning. Ann CIRP 52: 359–362.
Ogbu FA and Smith DK (1990). Simulated annealing for the permutation flowshop problem. Omega 19: 64–67.
Park SJ, Kim JW and Kang HW (1996). Heuristic knowledge representation of production scheduling: An integrated modeling approach. Expert Syst Appl 3/4: 325–339.
Percy DF and Kobbacy KAH (2000). Determining economical maintenance intervals. Int J Prod Econ 67: 87–94.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Ławrynowicz, A. Integration of production planning and scheduling using an expert system and a genetic algorithm. J Oper Res Soc 59, 455–463 (2008). https://doi.org/10.1057/palgrave.jors.2602423
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1057/palgrave.jors.2602423