A Novel Discrete League Championship Algorithm for Minimizing Earliness/Tardiness Penalties with Distinct Due Dates and Batch Delivery Consideration

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.