Publication:
Solving the unrelated parallel batch machine scheduling problem with mixed-integer programming

dc.contributor.buuauthorBakir, Merve
dc.contributor.buuauthorSebatli-Saglam, Asli
dc.contributor.buuauthorCavdur, Fatih
dc.contributor.buuauthorÇAVDUR, FATİH
dc.contributor.departmentBursa Uludağ Üniversitesi/Mühendislik Fakültesi.
dc.contributor.orcid0000-0003-3300-8773
dc.contributor.orcid0000-0002-9445-6740
dc.contributor.researcheridJYP-7925-2024
dc.contributor.researcheridAAC-2099-2020
dc.date.accessioned2024-06-24T13:45:59Z
dc.date.available2024-06-24T13:45:59Z
dc.date.issued2021-12-31
dc.description.abstractIn this study, the problem of scheduling jobs with arbitrary sizes and non-zero release times on a set of unrelated parallel batch processing machines with different capacities is discussed. Three mixed-integer programming models with different objective functions are developed to solve the problem. Corresponding models aim at minimizing (i) the total flow time, (ii) the makespan and (iii) the total tardiness, respectively, which are considered to be among the most important objectives in scheduling problems. In order to test the validity and applicability of the proposed solution approach, different datasets are generated using some rules in the literature. The results obtained by solving the mathematical programming models with these data sets are analyzed in terms of some performance parameters.
dc.identifier.doi10.2339/politeknik.996529
dc.identifier.endpage663
dc.identifier.issn1302-0900
dc.identifier.issue2
dc.identifier.startpage653
dc.identifier.urihttps://doi.org/10.2339/politeknik.996529
dc.identifier.urihttps://hdl.handle.net/11452/42305
dc.identifier.volume26
dc.identifier.wos000740212100001
dc.indexed.wosWOS.ESCI
dc.language.isoen
dc.publisherGazi Üniversitesi
dc.relation.journalJournal Of Polytechnic-politeknik Dergisi
dc.relation.publicationcategoryMakale - Uluslararası Hakemli Dergi
dc.rightsinfo:eu-repo/semantics/closedAccess
dc.subjectIterated greedy algorithm
dc.subjectNonidentical job sizes
dc.subjectTotal flow time
dc.subjectProcessing machines
dc.subjectMinimizing makespan
dc.subjectWeighted-tardiness
dc.subjectRelease times
dc.subjectMinimization
dc.subjectCapacities
dc.subjectEarliness
dc.subjectUnrelated parallel batch processing
dc.subjectMachine scheduling
dc.subjectTotal flow time
dc.subjectMakespan
dc.subjectTotal tardiness
dc.subjectMixed-integer programming
dc.subjectScience & technology
dc.subjectTechnology
dc.subjectEngineering, multidisciplinary
dc.subjectEngineering
dc.titleSolving the unrelated parallel batch machine scheduling problem with mixed-integer programming
dc.typeArticle
dspace.entity.typePublication
relation.isAuthorOfPublication488d40a8-9d9d-4814-89f3-0a6433d547cc
relation.isAuthorOfPublication.latestForDiscovery488d40a8-9d9d-4814-89f3-0a6433d547cc

Files

Collections