Addressing lot sizing and warehousing scheduling problem in manufacturing environment

详细信息    查看全文

• 作者：N. Mishra^a ; ^{nxm@cs.nott.ac.uk"" rel=""nofollow} ; V. Kumar^b ; ^{vikas.kumar@dcu.ie"" rel=""nofollow} ; N. Kumar^c ; ^{N.Kumar@bath.ac.uk"" rel=""nofollow} ; M. Kumar^d ; ^{m.kumar@napier.ac.uk"" rel=""nofollow} ; M.K. Tiwari^e ; ^{mkt09@hotmail.com"" rel=""nofollow}
• 关键词：Warehousing ; GA ; SA ; Tardiness ; Lot-sizing ; Scheduling
• 刊名：Expert Systems with Applications
• 出版年：2011
• 出版时间：September 2011
• 年：2011
• 卷：38
• 期：9
• 页码：11751-11762
• 全文大小：509 K

文摘

In recent years, lot sizing issues have gained attention of researchers worldwide. Previous studies devoted on lot sizing scheduling problems were primarily focused within the production unit in a manufacturing plant. In this article lot sizing concept is explored in the context of warehouse management. The proposed formulation helps manufacturer to decide the effective lot-size in order to meet the due dates while transferring the product from manufacturer to retailer through warehouse. A constrained based fast simulated annealing (CBFSA) algorithm is used to effectively handle the problem. CBFSA algorithm encapsulates the salient features of both genetic algorithm (GA) and simulated annealing (SA) algorithms. This hybrid solution approach possesses the mixed characteristics of both of the algorithms and determines the optimal/near optimal sequence while taking into consideration the lot-size. Results obtained after implementing the proposed approach reveals the efficacy of the model over various problem dimensions and shows its superiority over other approaches (GA and SA).