Show simple item record

dc.contributor.authorKayan, R. K.en_US
dc.contributor.authorAkturk, M. S.en_US
dc.date.accessioned2016-02-08T10:20:52Z
dc.date.available2016-02-08T10:20:52Z
dc.date.issued2005en_US
dc.identifier.issn0377-2217
dc.identifier.urihttp://hdl.handle.net/11693/23894
dc.description.abstractIn this study, we determine the upper and lower bounds for the processing time of each job under controllable machining conditions. The proposed bounding scheme is used to find a set of discrete efficient points on the efficient frontier for a bi-criteria scheduling problem on a single CNC machine. We have two objectives; minimizing the manufacturing cost (comprised of machining and tooling costs) and minimizing makespan. The technological restrictions of the CNC machine along with the job specific parameters affect the machining conditions; such as cutting speed and feed rate, which in turn specify the processing times and tool lives. Since it is well known that scheduling problems are extremely sensitive to processing time data, system resources can be utilized much more efficiently by selecting processing times appropriately.en_US
dc.language.isoEnglishen_US
dc.source.titleEuropean Journal of Operational Researchen_US
dc.relation.isversionofhttp://dx.doi.org/10.1016/j.ejor.2004.07.012en_US
dc.subjectAutomated manufacturingen_US
dc.subjectBi-criteriaen_US
dc.subjectControllable processing timesen_US
dc.subjectMakespanen_US
dc.subjectSchedulingen_US
dc.titleA new bounding mechanism for the CNC machine scheduling problems with controllable processing timesen_US
dc.typeArticleen_US
dc.departmentDepartment of Industrial Engineeringen_US
dc.citation.spage624en_US
dc.citation.epage643en_US
dc.citation.volumeNumber167en_US
dc.citation.issueNumber3en_US
dc.identifier.doi10.1016/j.ejor.2004.07.012en_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