Author： Mohammadi M. Fatemi Ghomi S. Karimi B. Torabi S.
Publisher： Springer Publishing Company
ISSN： 0956-5515
Source： Journal of Intelligent Manufacturing, Vol.21, Iss.4, 2010-08, pp. : 501-510
Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.
Abstract
This paper discusses the multi-product multi-level capacitated lotsizing and scheduling problem with sequence-dependent setups. An exact formulation of the problem is provided as a mixed-integer program which is impractical to solve in reasonable computing time for non-small instances. To solve non-small instances of the problem, MIP-based heuristics are provided. To test the accuracy of heuristics, two lower bounds are developed and compared against the optimal solution. The trade-offs between schedule quality and computational time of heuristics are also provided.
Related content
Access to resources
Recommend
