{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,14]],"date-time":"2025-05-14T05:28:22Z","timestamp":1747200502077,"version":"3.40.5"},"reference-count":30,"publisher":"Journal of the Faculty of Engineering and Architecture of Gazi University","issue":"1","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"accepted":{"date-parts":[[2023,2,26]]},"abstract":"<jats:p xml:lang=\"tr\">Geleneksel k\u0131s\u0131tland\u0131r\u0131lm\u0131\u015f parti b\u00fcy\u00fckl\u00fc\u011f\u00fc belirleme problemi i\u015fletmelerde s\u0131kl\u0131kla kar\u015f\u0131la\u015f\u0131lan problemlerden biridir. Ancak, bu problemlerin modellenme a\u015famas\u0131nda ger\u00e7ek hayatta ge\u00e7erli olabilen pek \u00e7ok fakt\u00f6r dikkate al\u0131nmamaktad\u0131r. Bu \u00e7al\u0131\u015fmada, sipari\u015f \u00fczerine ka\u011f\u0131t\/karton \u00e7anta \u00fcretimi yapan bir i\u015fletmedeki b\u00fct\u00fcnle\u015fik parti b\u00fcy\u00fckl\u00fc\u011f\u00fc belirleme ve \u00e7izelgeleme problemi modellenerek \u00e7\u00f6z\u00fcmlenmi\u015ftir. Problem i\u00e7in kar\u0131\u015f\u0131k tam say\u0131l\u0131 programlama modeli \u00f6nerilmi\u015ftir. \u00d6nerilen modelde, \u00fcr\u00fcnler aras\u0131 ge\u00e7i\u015flerde ve \u00fcretim periyotlar\u0131ndaki haz\u0131rl\u0131k s\u00fcreleri ve maliyetleri g\u00f6z \u00f6n\u00fcnde bulundurulmu\u015ftur. Geli\u015ftirilen model, \u00fcretim maliyeti, elde tutma maliyeti, kar\u015f\u0131lanamayan talep maliyeti, d\u0131\u015fardan sat\u0131n alma maliyeti ve s\u0131ra ba\u011f\u0131ml\u0131 \u00fcr\u00fcn ge\u00e7i\u015flerinin haz\u0131rl\u0131k maliyeti toplam\u0131n\u0131 en k\u00fc\u00e7\u00fcklemeyi hedeflemektedir. Geli\u015ftirilen modelin uygulamas\u0131yla, \u00fcretim kaynaklar\u0131n\u0131n daha verimli kullan\u0131l\u0131p daha efektif \u00fcretim planlar\u0131n\u0131n ortaya konulabilece\u011fi g\u00f6r\u00fclm\u00fc\u015ft\u00fcr.<\/jats:p>","DOI":"10.17341\/gazimmfd.1130887","type":"journal-article","created":{"date-parts":[[2023,8,11]],"date-time":"2023-08-11T12:25:01Z","timestamp":1691756701000},"page":"401-416","source":"Crossref","is-referenced-by-count":0,"title":["Dinamik parti b\u00fcy\u00fckl\u00fc\u011f\u00fc belirleme ve \u00e7izelgeleme problemi i\u00e7in bir matsezgisel geli\u015ftirilmesi ve uygulamas\u0131"],"prefix":"10.17341","volume":"39","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3435-0167","authenticated-orcid":true,"given":"Burcu","family":"KUBUR \u00d6ZBEL","sequence":"first","affiliation":[{"name":"DOKUZ EYL\u00dcL \u00dcN\u0130VERS\u0130TES\u0130, FEN B\u0130L\u0130MLER\u0130 ENST\u0130T\u00dcS\u00dc"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4952-7239","authenticated-orcid":true,"given":"Adil","family":"BAYKASO\u011eLU","sequence":"additional","affiliation":[{"name":"DOKUZ EYL\u00dcL \u00dcN\u0130VERS\u0130TES\u0130"}]}],"member":"7101","published-online":{"date-parts":[[2023,8,21]]},"reference":[{"key":"ref1","unstructured":"1.\tTatar T., \u0130\u015fletmelerde \u00dcretim Y\u00f6netimi ve Teknikleri, A.D.M.M.A Yay\u0131nlar\u0131, Ankara, 1985."},{"key":"ref2","doi-asserted-by":"crossref","unstructured":"2.\tStadtler H., ve Kilger C., Supply Chain Management And Advanced Planning. Concepts, Models, Software and Case Studies, Springer, 2008.","DOI":"10.1007\/978-3-540-74512-9"},{"key":"ref3","doi-asserted-by":"crossref","unstructured":"3.\tBitran, G.R., ve Yanasse H.H., Computational complexity of the capacitated lot size problem, Management Science, 28(10), 1174-1186, 1982.","DOI":"10.1287\/mnsc.28.10.1174"},{"key":"ref4","doi-asserted-by":"crossref","unstructured":"4.\tCarravilla M. A., ve  de Sousa J.P., Hierarchical production planning in a make-to-order company: A case study, European Journal of Operational Research, 86 (1), 43-56,1995.","DOI":"10.1016\/0377-2217(95)00060-4"},{"key":"ref5","doi-asserted-by":"crossref","unstructured":"5.\tZhu X., ve Wilhelm W.E., Scheduling and lot sizing with sequence-dependent setup: A literature review, IIE Transactions, 38 (11), 987-1007, 2006.","DOI":"10.1080\/07408170600559706"},{"key":"ref6","doi-asserted-by":"crossref","unstructured":"6.\tNeureuther B.D., Polak G.G., ve Sanders N.R., A hierarchical production plan for a make-to-order steel fabrication plant,  Production Planning & Control, 15(3), 324-335, 2004.","DOI":"10.1080\/09537280410001703893"},{"key":"ref7","unstructured":"7.\tClark A.R., Neto R.M., ve Toso E.A., Multi-period production setup-sequencing and lot-sizing through ATSP subtour elimination and patching, In Proceedings of the 25th Workshop of the UK Planning and Scheduling Special Interest Group, 80-87, December, 2006."},{"key":"ref8","doi-asserted-by":"crossref","unstructured":"8.\tWolsey L.A., Lot-sizing with production and delivery time windows, Mathematical Programming, 107(3), 471-489, 2006.","DOI":"10.1007\/s10107-005-0675-3"},{"key":"ref9","doi-asserted-by":"crossref","unstructured":"9.\tAlmada-Lobo B., Klabjan D., Ant\u00f3nia Carravilla M., ve Oliveira J.F., Single machine multi-product capacitated lot sizing with sequence-dependent setups, International Journal of Production Research, 45(20), 4873-4894, 2007.","DOI":"10.1080\/00207540601094465"},{"key":"ref10","doi-asserted-by":"crossref","unstructured":"10.\tLi Y.,  Tao Y., ve Wang F., An effective approach to multi-item capacitated dynamic lot-sizing problems, International Journal of Production Research, 50(19), 5348\u20135362, 2012.","DOI":"10.1080\/00207543.2011.626459"},{"key":"ref11","doi-asserted-by":"crossref","unstructured":"11.\tChen C.S., Mestry S., Damodaran P., ve Wang C., The capacity planning problem in make-to-order enterprises, Mathematical and Computer Modelling, 50(9), 1461-1473, 2009.","DOI":"10.1016\/j.mcm.2009.07.010"},{"key":"ref12","doi-asserted-by":"crossref","unstructured":"12.\tEhrenberg C., ve Zimmermann J., Simulation-based optimization in make-to-order production: scheduling for a special-purpose glass manufacturer, In Simulation Conference (WSC) Proceedings of the 2012 Winter IEEE., 1-12, December, 2012.","DOI":"10.1109\/WSC.2012.6465047"},{"key":"ref13","doi-asserted-by":"crossref","unstructured":"13.\tGansterer M., Almeder C., Hartl R., Simulation-based optimization methods for setting production planning parameter, International Journal of Production Economics, 151, 206\u2013213, 2013.","DOI":"10.1016\/j.ijpe.2013.10.016"},{"key":"ref14","doi-asserted-by":"crossref","unstructured":"14.\tChien-Chung L., Optimisation of make-to-order production for multiple-line production, South African Journal of Industrial Engineering, 24(3), 139-149, 2013.","DOI":"10.7166\/24-3-639"},{"key":"ref15","doi-asserted-by":"crossref","unstructured":"15.\tBruno G., Genovese A., ve Piccolo C., The capacitated lot-sizing model: a poowerful tool for logistics decision making, International Journal of Production Economics, 155, 380-390, 2014.","DOI":"10.1016\/j.ijpe.2014.03.008"},{"key":"ref16","doi-asserted-by":"crossref","unstructured":"16.\tRamezanian R., Saidi-Mehrabad  M., ve Teimoury E., A mathematical model for integrating lot-sizing and scheduling problem in capacitated flow shop environments, International Journal of Advanced Manufacturing Technology, 66, 347-361, 2013.","DOI":"10.1007\/s00170-012-4329-3"},{"key":"ref17","doi-asserted-by":"crossref","unstructured":"17.\tRangel S., ve Maldonado M., Three mathematical models for a \u0131ntegrated lot sizing and scheduling problem, Proceeding Series of the Brazilian Society of Applied and Computational Mathematics, 2 (1), 1-6, 2014.","DOI":"10.5540\/03.2014.002.01.0117"},{"key":"ref18","doi-asserted-by":"crossref","unstructured":"18.\tGansterer M., Aggregate planning and forecasting \u0131n make-to-order production systems, International Journal of Production Economics, 170, 521\u2013528, 2015.","DOI":"10.1016\/j.ijpe.2015.06.001"},{"key":"ref19","doi-asserted-by":"crossref","unstructured":"19.\tLi X., Guo S., Liu Y., Du B., ve Wang L.,  A production planning model for make-to-order foundry flow shop with capacity constraint, Mathematical Problems in Engineering, 2017.","DOI":"10.1155\/2017\/6315613"},{"key":"ref20","doi-asserted-by":"crossref","unstructured":"20.\tJi Q., Wang Y., ve Hu X., Optimal production planning for assembly systems with uncertain capacities and random demand, European Journal of Operational Research, 253(2), 383\u2013391, 2016.","DOI":"10.1016\/j.ejor.2016.02.021"},{"key":"ref21","doi-asserted-by":"crossref","unstructured":"21.\tMula, J., D\u00edaz-Madro\u00f1ero, M., Andres, B., Poler, R., ve Sanchis, R., A capacitated lot-sizing model with sequence-dependent setups, parallel machines and bi-part injection moulding, Applied Mathematical Modelling, 100, 805-820, 2021.","DOI":"10.1016\/j.apm.2021.07.028"},{"key":"ref22","doi-asserted-by":"crossref","unstructured":"22.\tGupta D., ve Magnusson T., The capacitated lot-sizing and scheduling problem with sequence-dependent setup costs and setup times, Computers & Operations Research, 32(4), 727-747, 2005.","DOI":"10.1016\/j.cor.2003.08.014"},{"key":"ref23","doi-asserted-by":"crossref","unstructured":"23.\tBoschetti M., Maniezzo V., Roffilli M., R\u00f6hler A.B., Matheuristics: optimization, Simulation and Control, Blesa M., Blum C., Raidl G., Roli A., Sampels M., Springer, Berlin, 171-177, 2010.","DOI":"10.1007\/978-3-642-04918-7_13"},{"key":"ref24","unstructured":"24.\tCroce F. D., Grosso A. ve Salassa F., Matheuristics: Embedding MILP solvers into heuristic algorithms for combinatorial optimization problems, Heuristics: Theory and applications, Edit\u00f6r: Siarry P., Nova Science Publishera, Inc., New York, 53-68, 2013."},{"key":"ref25","doi-asserted-by":"crossref","unstructured":"25.\tKoch, C., Arbaoui, T., Ouazene, Y., Yalaoui, F., De Brunier, H., Jaunet, N., ve De Wulf, A., A Matheuristic Approach for Solving a Simultaneous Lot Sizing and Scheduling Problem with Client Prioritization in Tire Industry, Computers & Industrial Engineering, 107932. 2022.","DOI":"10.1016\/j.cie.2022.107932"},{"key":"ref26","doi-asserted-by":"crossref","unstructured":"26.\tCunha, J. O., Kramer, H. H., ve Melo, R. A., Effective matheuristics for the multi-item capacitated lot-sizing problem with remanufacturing, Computers & Operations Research, 104, 149-158, 2019.","DOI":"10.1016\/j.cor.2018.12.012"},{"key":"ref27","doi-asserted-by":"crossref","unstructured":"27.\tCarvalho, D. M., ve Nascimento, M. C., Hybrid matheuristics to solve the integrated lot sizing and scheduling problem on parallel machines with sequence-dependent and non-triangular setup, European Journal of Operational Research, 296(1), 158-173, 2022.","DOI":"10.1016\/j.ejor.2021.03.050"},{"key":"ref28","doi-asserted-by":"crossref","unstructured":"28.\tKirkpatrick, S., Gelatt, Jr.C.D. ve Vecchi, M.P., Optimization by Simulated Annealing, Science, Cilt 220, No 4598, 671-680, 1983.","DOI":"10.1126\/science.220.4598.671"},{"key":"ref29","doi-asserted-by":"crossref","unstructured":"29.\tTsang, H. H., ve Wiese, K. C. A study of different annealing schedules in SARNA-predict: A permutation based SA algorithm for RNA folding. International Journal of Intelligent Computing and Cybernetics, 2015.","DOI":"10.1108\/IJICC-02-2015-0007"},{"key":"ref30","doi-asserted-by":"crossref","unstructured":"30.\tXing, Y., ve Wang, Y. Minimizing assembly variation in selective assembly for auto-body parts based on IGAOT. International journal of intelligent computing and cybernetics, 2018.","DOI":"10.1108\/IJICC-10-2016-0039"}],"container-title":["Gazi \u00dcniversitesi M\u00fchendislik Mimarl\u0131k Fak\u00fcltesi Dergisi"],"original-title":[],"deposited":{"date-parts":[[2023,8,27]],"date-time":"2023-08-27T16:51:39Z","timestamp":1693155099000},"score":1,"resource":{"primary":{"URL":"http:\/\/dergipark.org.tr\/tr\/doi\/10.17341\/gazimmfd.1130887"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,8,21]]},"references-count":30,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2023,8,21]]}},"URL":"https:\/\/doi.org\/10.17341\/gazimmfd.1130887","relation":{},"ISSN":["1300-1884"],"issn-type":[{"type":"print","value":"1300-1884"}],"subject":[],"published":{"date-parts":[[2023,8,21]]}}}