A hybrid discrete differential evolution algorithm for economic lot scheduling problem with time variant lot sizing

• Main Authors: Suganthan, P. N., Ganguly, Srinjoy, Chowdhury, Arkabandhu, Mukherjee, Swahum, Das, Swagatam, Chua, Tay Jin
• Other Authors: School of Electrical and Electronic Engineering
• Format: Conference or Workshop Item
• Language: English
• Published: 2013
• Online Access: https://hdl.handle.net/10356/104626; http://hdl.handle.net/10220/18248; http://link.springer.com.ezlibproxy1.ntu.edu.sg/chapter/10.1007%2F978-3-642-32922-7_1#
• Institution: Nanyang Technological University

This article presents an efficient Hybrid Discrete Differential Evolution (HDDE) model to solve the Economic Lot Scheduling Problem (ELSP) using a time variant lot sizing approach. This proposed method introduces a novel Greedy Reordering Local Search (GRLS) operator as well as a novel Discrete DE scheme for solving the problem. The economic lot-scheduling problem (ELSP) is an important production scheduling problem that has been intensively studied. In this problem, several products compete for the use of a single machine, which is very similar to the real-life industrial scenario, in particular in the field of remanufacturing. The experimental results indicate that the proposed algorithm outperforms several previously used heuristic algorithms under the time-varying lot sizing approach.