A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf
.
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
2014
Uncertain Supply Chain Management
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;
doi:10.5267/j.uscm.2014.4.003
fatcat:yvuqkekgfrdo3eld7ebuft7aby