Show simple item record

dc.contributor.authorErenay, F. S.en_US
dc.contributor.authorSabuncuoglu, I.en_US
dc.contributor.authorToptal, A.en_US
dc.contributor.authorTiwari, M. K.en_US
dc.date.accessioned2016-02-08T09:59:59Z
dc.date.available2016-02-08T09:59:59Z
dc.date.issued2010en_US
dc.identifier.issn0377-2217
dc.identifier.urihttp://hdl.handle.net/11693/22429
dc.description.abstractWe consider the bicriteria scheduling problem of minimizing the 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 four new heuristics to solve this multiobjective scheduling problem. Two of these heuristics are constructive algorithms based on beam search methodology. The other two are metaheuristic approaches using a genetic algorithm and tabu-search. Our computational experiments indicate that the proposed beam search heuristics find efficient schedules optimally in most cases and perform better than the existing heuristics in the literature.en_US
dc.language.isoEnglishen_US
dc.source.titleEuropean Journal of Operational Researchen_US
dc.relation.isversionofhttp://dx.doi.org/10.1016/j.ejor.2009.02.014en_US
dc.subjectBicriteria schedulingen_US
dc.subjectAverage flowtimeen_US
dc.subjectNumber of tardy jobsen_US
dc.subjectBeam searchen_US
dc.titleNew solution methods for single machine bicriteria scheduling problem: Minimization of average flowtime and number of tardy jobsen_US
dc.typeArticleen_US
dc.departmentDepartment of Industrial Engineeringen_US
dc.citation.spage89en_US
dc.citation.epage98en_US
dc.citation.volumeNumber201en_US
dc.citation.issueNumber1en_US
dc.identifier.doi10.1016/j.ejor.2009.02.014en_US
dc.publisherElsevieren_US
dc.identifier.eissn1872-6860


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record