A novel discrete league championship algorithm for minimizing earliness/tardiness penalties with distinct due dates and batch delivery consideration

  • Authors:
  • Zahra Pourali;Majid Aminnayeri

  • Affiliations:
  • Department of Industrial Engineering, Amirkabir University of Technology, Tehran, Iran;Department of Industrial Engineering, Amirkabir University of Technology, Tehran, Iran

  • Venue:
  • ICIC'11 Proceedings of the 7th international conference on Advanced Intelligent Computing
  • Year:
  • 2011

Quantified Score

Hi-index 0.00

Visualization

Abstract

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.