Show simple item record

dc.contributor.advisorSabuncuoğlu, İhsan
dc.contributor.authorErenay, Fatih Safa
dc.date.accessioned2016-07-01T11:05:56Z
dc.date.available2016-07-01T11:05:56Z
dc.date.issued2006
dc.identifier.urihttp://hdl.handle.net/11693/29813
dc.descriptionCataloged from PDF version of article.en_US
dc.description.abstractIn this thesis, we consider the bicriteria scheduling problem of minimizing number of tardy jobs and average flowtime on a single machine. This problem, which is known to be NP-hard, is important in practice as the former criterion conveys the customer’s position and the latter reflects the manufacturer’s perspective in the supply chain. We propose two new heuristics to solve this multiobjective scheduling problem. These two heuristics are constructive algorithms which are based on beam search methodology. We compare these proposed algorithms with three existing heuristics in the literature and two new meta-heuristics. Our computational experiments illustrate that proposed heuristics find efficient schedules optimally in most of the cases and perform better than the other heuristics.en_US
dc.description.statementofresponsibilityErenay, Fatih Safaen_US
dc.format.extentix, 66 leaves, tablesen_US
dc.language.isoEnglishen_US
dc.rightsinfo:eu-repo/semantics/openAccessen_US
dc.subjectBicriteria Schedulingen_US
dc.subjectAverage Flowtimeen_US
dc.subjectNumber of Tardy Jobsen_US
dc.subjectBeam Searchen_US
dc.subject.lccTS157.5 .E74 2006en_US
dc.subject.lcshScheduling (Management) Mathematical models.en_US
dc.titleNew solution methods for single machine bicriteria scheduling problem : minimization of average flowtime and number of tardy jobsen_US
dc.typeThesisen_US
dc.departmentDepartment of Industrial Engineeringen_US
dc.publisherBilkent Universityen_US
dc.description.degreeM.S.en_US
dc.identifier.itemidBILKUTUPB099570


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record