A Genetic Algorithm Approach to Solve the General Lot Sizing and Scheduling Problem.
Main Article Content
Abstract
This paper presents preliminary results found by a genetic algorithm solving the general lot sizing and scheduling problem (GLSP) with single machine, sequence dependent setup cost and penalties for demands not satisfied. A set of instances are generated for this problem where solutions are first obtained using the solver CPLEX. Next, these solutions are used as benchmark to evaluate the GA results. The results found by GA shows its promising performance for the set of instances solved.
Article Details
How to Cite
Toledo, C. F. M., Arantes, M. da S., de Oliveira, R. R. R., de Oliveira, L., & França, P. M. (2010). A Genetic Algorithm Approach to Solve the General Lot Sizing and Scheduling Problem. INFOCOMP Journal of Computer Science, 9(6), 1–8. Retrieved from https://infocomp.dcc.ufla.br/index.php/infocomp/article/view/377
Section
Articles
Upon receipt of accepted manuscripts, authors will be invited to complete a copyright license to publish the paper. At least the corresponding author must send the copyright form signed for publication. It is a condition of publication that authors grant an exclusive licence to the the INFOCOMP Journal of Computer Science. This ensures that requests from third parties to reproduce articles are handled efficiently and consistently and will also allow the article to be as widely disseminated as possible. In assigning the copyright license, authors may use their own material in other publications and ensure that the INFOCOMP Journal of Computer Science is acknowledged as the original publication place.