A rolling horizon-based heuristic to solve a multi-level general lot sizing and scheduling problem with multiple machines (MLGLSP_MM) in job shop manufacturing system

Abstract

Article history: Received December 10, 2013 Received in revised format 12 March 2014 Accepted April 24 2014 Available online April 25 2014 This article addresses multi-level lot sizing and scheduling problem in capacitated, dynamic and deterministic cases of a job shop manufacturing system with sequence-dependent setup times and costs assumptions. A new mixed-integer programing (MIP) model with big bucket time approach is provided to the problem formulation. It is well known that the capacitated lot sizing and scheduling problem (CLSP) is NP-hard. The problem of this paper that it is an extent of the CLSP is even more complicated; consequently, it necessitates the use of approximated methods to solve this problem. Hence, two new mixed integer programming-based approaches with rolling horizon framework have been used to solve this model. To evaluate the performance of the proposed model and algorithms, some numerical experiments are conducted. The comparative results indicate the superiority of the second heuristic. © 2014 Growing Science Ltd. All rights reserved.