In this paper, we develop a new evolutionary algorithm called League Championship Algorithm (LCA) to solve a new single machine scheduling nonlinear problem in JIT environment with batch delivery cost and distinct due dates. Despite its hardness, solving a non-convex function which minimizes earliness and tardiness costs simultaneously seems to be very useful and practical in industrial environments. In order to solve this complex problem, first we present a mathematical model and then design a new discrete nonlinear version of the LCA algorithm which is very efficient and helpful in combinatorial problems, either in terms of computational time or solution quality. © 2011 Springer-Verlag.
CITATION STYLE
Pourali, Z., & Aminnayeri, M. (2011). A novel discrete league championship algorithm for minimizing earliness/tardiness penalties with distinct due dates and batch delivery consideration. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6838 LNCS, pp. 139–146). https://doi.org/10.1007/978-3-642-24728-6_19
Mendeley helps you to discover research relevant for your work.