An Effective Genetic Algorithm for a Complex Real-World Scheduling Problem

Authors: Anis Gharbi, Mohamed Haouari, Talel Ladhari, Mohamed Ali Rakrouki

Abstract:

We address a complex scheduling problem arising in the wood panel industry with the objective of minimizing a quadratic function of job tardiness. The proposed solution strategy, which is based on an effective genetic algorithm, has been coded and implemented within a major Tunisian company, leader in the wood panel manufacturing. Preliminary experimental results indicate significant decrease of delivery times.

Keywords: Genetic algorithm, heuristic, hybrid flowshop, total weighted squared tardiness.

Digital Object Identifier (DOI): doi.org/10.5281/zenodo.1088380

References:

[1] S. Bertel, and J.C. Billaut, “A genetic algorithm for an industrial multiprocessor flow shop scheduling problem with recirculation”, European Journal of Operational Research, vol. 159, p. 651–662, 2004.
[2] J. W. Chung, S. M. Oh, and I. C Choi, “A hybrid genetic algorithm for train sequencing in the Korean railway”, OMEGA The International Journal of Management Science, vol. 37, p. 555–565, 2009.
[3] E. Hart, P. Ross, and J.A.D. Nelson, “Scheduling chicken catching - an investigation into the success of a genetic algorithm on a real-world scheduling problem”, Annals of Operations Research, vol. 92, p. 363– 380, 1999.
[4] M. Nawaz, E. E. Enscore, and I. Ham, “A heuristic algorithm for the Flow shop problem”, European Journal of Operational Research, vol. 91, p. 160–175, 1983.
[5] P.C. Pendharkar, and J.A. Roger, “Nonlinear programming and genetic search application for production scheduling in coal mines”, Annals of Operations Research, vol. 95, p. 251–267, 2000.
[6] Rochat, Y., “A genetic approach for solving a scheduling problem in a robotized analytical system”, Journal of Heuristics, vol. 4, p. 245–261, 1998.