Aytaç Ali AslanerAkdeniz CoşkunNur İlayda TülemişEce ÖzboyacıNil ErgünBerk BulutGörkem GülbentMert PaldrakEfthimia StaiouAslaner, Aytaç AliErgün, NilBulut, BerkÖzboyacı, EceStaiou, EfthymiaCoşkun, AkdenizTülemiş, Nur İlaydaN.M. Durakbasa , M.G. Gençyılmaz2025-10-0620219789819650583, 9783031991585, 9783031948886, 9789819667314, 9789811937156, 9783030703318, 9789811622779, 9789811969447, 9789819701056, 9789819748051978303062783621954364, 219543562195-435610.1007/978-3-030-62784-3_662-s2.0-85096471798https://www.scopus.com/inward/record.uri?eid=2-s2.0-85096471798&doi=10.1007%2F978-3-030-62784-3_66&partnerID=40&md5=6ee480bc8e564e3af4c95b127e780252https://gcris.yasar.edu.tr/handle/123456789/9111https://doi.org/10.1007/978-3-030-62784-3_66In this study a production planning and scheduling problem is carried out in a company operating in the plastic injection sector in Turkey. The scheduling problem is classified as unrelated parallel machine scheduling problem with sequence dependent setup times including job-machine eligibility common source and precedence constraints. The proposed solution methodology is based on weekly planning with order grouping and makespan minimization. As a result a mixed integer programming model was formulated and optimal results are obtained for a sample data set with real data received. A user-friendly Decision Support System (DSS) was created to help the company with the weekly production planning and scheduling process applying a heuristic approach solution. © 2020 Elsevier B.V. All rights reserved.Englishinfo:eu-repo/semantics/closedAccessBest-fit Algorithm, Common Molds, Heuristic Approach, Machine Eligibility, Parallel Machine Scheduling, Precedence Relations, Sequence-dependent Setup TimesPrecedence RelationsCommon MoldsParallel Machine SchedulingBest-Fit AlgorithmSequence-Dependent Setup TimesHeuristic ApproachMachine EligibilityConference Object