Classifying and modeling setups and cleanings in lot sizing and scheduling. Stefansdottir, B., Grunow, M., & Akkerman, R. European Journal of Operational Research, 261(3):849–865, 2017. doi abstract bibtex Much attention in the lot sizing and scheduling literature has been focused on reducing the number and size of setups. Cleanings, in contrast, remain a key cost driver in large parts of the process industries such as the food and pharmaceutical sectors. Here, quality and safety considerations lead to a diversity of cleaning requirements. A prerequisite for an efficient use of resources is an accurate representation of the constraints imposed by the different setups and cleanings. In this paper, we therefore first develop a general classification scheme for setups and cleanings. Three different classes are identified: batch-, time-, and volume-dependent setups and cleanings. The classes are further differentiated based on their separability, substitutability, reference point, flexibility, product dependency, and batch-size dependency. Secondly, we develop a generic optimization model for lot sizing and scheduling in the typical process-industry setting of flowshops, accurately representing all setup and cleaning classes. Thirdly, we apply the model to the case of cheese production in no-wait flowshops, demonstrating the adaptability of the generic model to industry-specific settings as well as the computational efficiency of the approach. The results show that significant reductions in machine downtime and makespan are achieved. Finally, our numerical tests provide insights into the extent to which a misidentification of cleaning classes may decrease scheduling flexibility and impair solution quality. Our results also show the benefits of considering the heterogeneity in processing times, which can be used to compensate for setup- and cleaning-time differences during successive production stages.
@article{stefansdottir_classifying_2017,
title = {Classifying and modeling setups and cleanings in lot sizing and scheduling},
volume = {261},
issn = {0377-2217},
doi = {10.1016/j.ejor.2017.03.023},
abstract = {Much attention in the lot sizing and scheduling literature has been focused on reducing the number and size of setups. Cleanings, in contrast, remain a key cost driver in large parts of the process industries such as the food and pharmaceutical sectors. Here, quality and safety considerations lead to a diversity of cleaning requirements. A prerequisite for an efficient use of resources is an accurate representation of the constraints imposed by the different setups and cleanings. In this paper, we therefore first develop a general classification scheme for setups and cleanings. Three different classes are identified: batch-, time-, and volume-dependent setups and cleanings. The classes are further differentiated based on their separability, substitutability, reference point, flexibility, product dependency, and batch-size dependency. Secondly, we develop a generic optimization model for lot sizing and scheduling in the typical process-industry setting of flowshops, accurately representing all setup and cleaning classes. Thirdly, we apply the model to the case of cheese production in no-wait flowshops, demonstrating the adaptability of the generic model to industry-specific settings as well as the computational efficiency of the approach. The results show that significant reductions in machine downtime and makespan are achieved. Finally, our numerical tests provide insights into the extent to which a misidentification of cleaning classes may decrease scheduling flexibility and impair solution quality. Our results also show the benefits of considering the heterogeneity in processing times, which can be used to compensate for setup- and cleaning-time differences during successive production stages.},
language = {English},
number = {3},
journal = {European Journal of Operational Research},
author = {Stefansdottir, Bryndis and Grunow, Martin and Akkerman, Renzo},
year = {2017},
keywords = {Dairy production, Flowshop, Mixed integer linear programming, Scheduling, Setup and cleaning},
pages = {849--865}
}
Downloads: 0
{"_id":"Gd5Zz3TSLAqho9ati","bibbaseid":"stefansdottir-grunow-akkerman-classifyingandmodelingsetupsandcleaningsinlotsizingandscheduling-2017","authorIDs":[],"author_short":["Stefansdottir, B.","Grunow, M.","Akkerman, R."],"bibdata":{"bibtype":"article","type":"article","title":"Classifying and modeling setups and cleanings in lot sizing and scheduling","volume":"261","issn":"0377-2217","doi":"10.1016/j.ejor.2017.03.023","abstract":"Much attention in the lot sizing and scheduling literature has been focused on reducing the number and size of setups. Cleanings, in contrast, remain a key cost driver in large parts of the process industries such as the food and pharmaceutical sectors. Here, quality and safety considerations lead to a diversity of cleaning requirements. A prerequisite for an efficient use of resources is an accurate representation of the constraints imposed by the different setups and cleanings. In this paper, we therefore first develop a general classification scheme for setups and cleanings. Three different classes are identified: batch-, time-, and volume-dependent setups and cleanings. The classes are further differentiated based on their separability, substitutability, reference point, flexibility, product dependency, and batch-size dependency. Secondly, we develop a generic optimization model for lot sizing and scheduling in the typical process-industry setting of flowshops, accurately representing all setup and cleaning classes. Thirdly, we apply the model to the case of cheese production in no-wait flowshops, demonstrating the adaptability of the generic model to industry-specific settings as well as the computational efficiency of the approach. The results show that significant reductions in machine downtime and makespan are achieved. Finally, our numerical tests provide insights into the extent to which a misidentification of cleaning classes may decrease scheduling flexibility and impair solution quality. Our results also show the benefits of considering the heterogeneity in processing times, which can be used to compensate for setup- and cleaning-time differences during successive production stages.","language":"English","number":"3","journal":"European Journal of Operational Research","author":[{"propositions":[],"lastnames":["Stefansdottir"],"firstnames":["Bryndis"],"suffixes":[]},{"propositions":[],"lastnames":["Grunow"],"firstnames":["Martin"],"suffixes":[]},{"propositions":[],"lastnames":["Akkerman"],"firstnames":["Renzo"],"suffixes":[]}],"year":"2017","keywords":"Dairy production, Flowshop, Mixed integer linear programming, Scheduling, Setup and cleaning","pages":"849–865","bibtex":"@article{stefansdottir_classifying_2017,\n\ttitle = {Classifying and modeling setups and cleanings in lot sizing and scheduling},\n\tvolume = {261},\n\tissn = {0377-2217},\n\tdoi = {10.1016/j.ejor.2017.03.023},\n\tabstract = {Much attention in the lot sizing and scheduling literature has been focused on reducing the number and size of setups. Cleanings, in contrast, remain a key cost driver in large parts of the process industries such as the food and pharmaceutical sectors. Here, quality and safety considerations lead to a diversity of cleaning requirements. A prerequisite for an efficient use of resources is an accurate representation of the constraints imposed by the different setups and cleanings. In this paper, we therefore first develop a general classification scheme for setups and cleanings. Three different classes are identified: batch-, time-, and volume-dependent setups and cleanings. The classes are further differentiated based on their separability, substitutability, reference point, flexibility, product dependency, and batch-size dependency. Secondly, we develop a generic optimization model for lot sizing and scheduling in the typical process-industry setting of flowshops, accurately representing all setup and cleaning classes. Thirdly, we apply the model to the case of cheese production in no-wait flowshops, demonstrating the adaptability of the generic model to industry-specific settings as well as the computational efficiency of the approach. The results show that significant reductions in machine downtime and makespan are achieved. Finally, our numerical tests provide insights into the extent to which a misidentification of cleaning classes may decrease scheduling flexibility and impair solution quality. Our results also show the benefits of considering the heterogeneity in processing times, which can be used to compensate for setup- and cleaning-time differences during successive production stages.},\n\tlanguage = {English},\n\tnumber = {3},\n\tjournal = {European Journal of Operational Research},\n\tauthor = {Stefansdottir, Bryndis and Grunow, Martin and Akkerman, Renzo},\n\tyear = {2017},\n\tkeywords = {Dairy production, Flowshop, Mixed integer linear programming, Scheduling, Setup and cleaning},\n\tpages = {849--865}\n}\n\n","author_short":["Stefansdottir, B.","Grunow, M.","Akkerman, R."],"key":"stefansdottir_classifying_2017","id":"stefansdottir_classifying_2017","bibbaseid":"stefansdottir-grunow-akkerman-classifyingandmodelingsetupsandcleaningsinlotsizingandscheduling-2017","role":"author","urls":{},"keyword":["Dairy production","Flowshop","Mixed integer linear programming","Scheduling","Setup and cleaning"],"downloads":0,"html":""},"bibtype":"article","biburl":"https://bibbase.org/zotero/Corry62","creationDate":"2020-04-28T14:29:55.616Z","downloads":0,"keywords":["dairy production","flowshop","mixed integer linear programming","scheduling","setup and cleaning"],"search_terms":["classifying","modeling","setups","cleanings","lot","sizing","scheduling","stefansdottir","grunow","akkerman"],"title":"Classifying and modeling setups and cleanings in lot sizing and scheduling","year":2017,"dataSources":["f2rfphHh3AgsPBoN4"]}