We consider the stochastic economic lot scheduling problem (SELSP) with lost sales and random demand,
where switching between products is subject to sequence-dependent setup times. We propose a solution
based on simulation optimization using an iterative two-step procedure which combines global policy search
with local search heuristics for the traveling salesman sequencing subproblem. To optimize the production
cycle, we compare two criteria: minimizing total setup times and evenly distributing setups to obtain a more
regular production cycle. Based on a numerical study, we find that a policy with a balanced production cycle
leads to lower cost than other policies with unbalanced cycles. (authors' abstract)
| Identifer | oai:union.ndltd.org:VIENNA/oai:epub.wu-wien.ac.at:4398 |
| Date | 11 1900 |
| Creators | Löhndorf, Nils, Riel, Manuel, Minner, Stefan |
| Publisher | Elsevier |
| Source Sets | Wirtschaftsuniversität Wien |
| Language | English |
| Detected Language | English |
| Type | Article, PeerReviewed |
| Format | application/pdf |
| Relation | http://dx.doi.org/10.1016/j.ijpe.2014.05.006, http://www.elsevier.com/, http://epub.wu.ac.at/4398/ |
Page generated in 0.0021 seconds