An MIP-based heuristic approach to determine production lot size for capacitated single-stage production processes with stochastic demand on parallel machines
{"title":"An MIP-based heuristic approach to determine production lot size for capacitated single-stage production processes with stochastic demand on parallel machines","authors":"Supatchaya Chotayakul, V. Punyangarm","doi":"10.1109/ICITM.2017.7917898","DOIUrl":null,"url":null,"abstract":"This paper deals with the capacitated single-stage production lot sizing and scheduling problem with multiple items, setup time, stochastic demand and unrelated parallel machines. A stochastic mixed-integer linear programming model is proposed to formulate the problem. Based on the uncertain constraints, the chance constrained programming approach is used to transform them into equivalent deterministic constraints and then obtain an optimal solution by deterministic mixed-integer linear programming model. Due to the complexity of problem, the mixed-integer programming (MIP) of the equivalence deterministic model of the capacitated single-stage production lot sizing problem with multiple items, setup time, stochastic demand and unrelated parallel machines is reformulated as a shortest path reformulation problem. The proposed algorithm is evaluated through a numerical example. Computational results show that the proposed method gives optimal or near optimal solution and have good-quality result for the test problem.","PeriodicalId":340270,"journal":{"name":"2017 6th International Conference on Industrial Technology and Management (ICITM)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-03-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2017 6th International Conference on Industrial Technology and Management (ICITM)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICITM.2017.7917898","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
This paper deals with the capacitated single-stage production lot sizing and scheduling problem with multiple items, setup time, stochastic demand and unrelated parallel machines. A stochastic mixed-integer linear programming model is proposed to formulate the problem. Based on the uncertain constraints, the chance constrained programming approach is used to transform them into equivalent deterministic constraints and then obtain an optimal solution by deterministic mixed-integer linear programming model. Due to the complexity of problem, the mixed-integer programming (MIP) of the equivalence deterministic model of the capacitated single-stage production lot sizing problem with multiple items, setup time, stochastic demand and unrelated parallel machines is reformulated as a shortest path reformulation problem. The proposed algorithm is evaluated through a numerical example. Computational results show that the proposed method gives optimal or near optimal solution and have good-quality result for the test problem.