Show simple item record

dc.contributor.authorTürkcan, A.en_US
dc.contributor.authorSelim Aktürk, M.en_US
dc.contributor.authorStorer, R. H.en_US
dc.date.accessioned2016-02-08T10:29:40Z
dc.date.available2016-02-08T10:29:40Z
dc.date.issued2003en_US
dc.identifier.issn0020-7543
dc.identifier.urihttp://hdl.handle.net/11693/24456
dc.description.abstractIn this study, we solve the non-identical parallel CNC machine scheduling problem. We have two objectives: minimizing the manufacturing cost (comprising machining, non-machining and tooling costs) and minimizing the total weighted tardiness. The tooling constraints affect the non-machining times as well as the machining conditions, such as cutting speed and feed rate, which in turn specify the machining times and tool lives. We propose a two-stage algorithm to find optimal machining conditions and to determine machine allocation, tool allocation and part scheduling decisions. The proposed algorithm generates different schedules according to the relative importance of the objectives.en_US
dc.language.isoEnglishen_US
dc.source.titleInternational Journal of Production Researchen_US
dc.relation.isversionofhttp://dx.doi.org/10.1080/0020754031000087184en_US
dc.subjectAlgorithmsen_US
dc.subjectComputational methodsen_US
dc.subjectDecision makingen_US
dc.subjectFlexible manufacturing systemsen_US
dc.subjectHeuristic methodsen_US
dc.subjectSchedulingen_US
dc.subjectMachine allocationen_US
dc.subjectMachiningen_US
dc.titleNon-identical parallel CNC machine schedulingen_US
dc.typeArticleen_US
dc.departmentDepartment of Industrial Engineering
dc.citation.spage2143en_US
dc.citation.epage2168en_US
dc.citation.volumeNumber41en_US
dc.citation.issueNumber10en_US
dc.identifier.doi10.1080/0020754031000087184en_US
dc.publisherTaylor & Francisen_US
dc.identifier.eissn1366-588X


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record