Show simple item record

dc.contributor.authorAkturk, M. S.en_US
dc.contributor.authorGhosh, J. B.en_US
dc.contributor.authorGunes, E. D.en_US
dc.date.accessioned2015-07-28T11:57:17Z
dc.date.available2015-07-28T11:57:17Z
dc.date.issued2004-09-16en_US
dc.identifier.issn0377-2217
dc.identifier.urihttp://hdl.handle.net/11693/11268
dc.description.abstractWe consider a single machine sequencing problem subject to tool wear, where the objective is to minimize the total completion time. We briefly describe the problem and discuss its properties, complexity and solution. Mainly, however, we focus on the performance of the SPT list-scheduling heuristic. We provide theoretical worst-case bounds on SPT performance and also demonstrate its empirical behavior.en_US
dc.language.isoEnglishen_US
dc.source.titleEuropean Journal of Operational Researchen_US
dc.relation.isversionofhttp://dx.doi.org/10.1016/S0377-2217(03)00232-7en_US
dc.subjectSchedulingen_US
dc.subjectTool Changeen_US
dc.subjectSpt List-schedulingen_US
dc.subjectPerformance Analysisen_US
dc.titleScheduling with tool changes to minimize total completion time: basic results and SPT performanceen_US
dc.typeArticleen_US
dc.departmentDepartment of Industrial Engineeringen_US
dc.citation.spage784en_US
dc.citation.epage790en_US
dc.citation.volumeNumber157en_US
dc.citation.issueNumber3en_US
dc.identifier.doi10.1016/S0377-2217(03)00232-7en_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