Yucel Yilmaz OzturkogluÖztürkoǧlu, Yücel2025-10-06201313039709, 214717622147-17622-s2.0-84875987841https://www.scopus.com/inward/record.uri?eid=2-s2.0-84875987841&partnerID=40&md5=49946c768627fd571f499905fa2d5ef1https://gcris.yasar.edu.tr/handle/123456789/10139In this paper we consider a single machine scheduling problem with two criteria: minimizing both total flow time with total tardiness and minimize maximum tardiness with number of tardy jobs. Unlike the classical scheduling problems we use a job position deterioration which means that the job processing time increases as a function of the job position. Besides deteriorated jobs we also consider rate-modifying-activities which alter the efficiency of the deteriorating processor. This is the first paper to combine both time dependent processing times and problems with rate-modifying-activity in the bi-criteria objectives. To solve the new type of problem we introduce a new scheduling mathematical model which is based on one developed Ozturkoglu and Bulfin [1]. To analyze the efficiency of the mathematical model we use three different approaches. According to computational results up to 50 jobs can be solved in less than one minute. © 2023 Elsevier B.V. All rights reserved.Englishinfo:eu-repo/semantics/closedAccessBi-criteria, Deteriorated Jobs, Rate-modifying- Activity, Single-machine Scheduling, Deterioration, Machinery, Scheduling, Scheduling Algorithms, Bi-criteria, Deteriorated Jobs, Maximum Tardiness, Number Of Tardy Jobs, Rate-modifying Activity, Scheduling Problem, Single Machine Scheduling Problems, Single-machine Scheduling, Total Flowtime, Total Tardiness, EfficiencyDeterioration, Machinery, Scheduling, Scheduling algorithms, Bi-criteria, Deteriorated jobs, Maximum tardiness, Number of tardy jobs, Rate-modifying activity, Scheduling problem, Single machine scheduling problems, Single-machine scheduling, Total flowtime, Total tardiness, EfficiencyBi-criteriaRate-modifying-activityRate-Modifying- ActivityDeteriorated JobsSingle-Machine SchedulingArticle