Show simple item record

dc.contributor.authorAtan, M. O.en_US
dc.contributor.authorAkturk, M. S.en_US
dc.date.accessioned2016-02-08T10:07:25Z
dc.date.available2016-02-08T10:07:25Z
dc.date.issued2008en_US
dc.identifier.issn0020-7543
dc.identifier.urihttp://hdl.handle.net/11693/22983
dc.description.abstractIn this study, we solve the single CNC machine scheduling problem with controllable processing times. Our objective is to maximize the total profit that is composed of the revenue generated by the set of scheduled jobs minus the sum of total weighted earliness and weighted tardiness, tooling and machining costs. Customers offer multiple due dates to the manufacturer, each coming with a distinct price for the order that is decreasing as the date gets later, and the manufacturer has the flexibility to accept or reject the orders. We propose a number of ranking rules and scheduling algorithms that we employ in a four-stage heuristic algorithm that determines the processing times for each job and a final schedule for the accepted jobs simultaneously, to maximize the overall profit.en_US
dc.language.isoEnglishen_US
dc.source.titleInternational Journal of Production Researchen_US
dc.relation.isversionofhttp://dx.doi.org/10.1080/00207540701262913en_US
dc.subjectSchedulingen_US
dc.subjectTotal weighted tardiness and earlinessen_US
dc.subjectMultiple due datesen_US
dc.subjectControllable processing timesen_US
dc.subjectHeuristicsen_US
dc.subjectOrder rejectionen_US
dc.titleSingle CNC machine scheduling with controllable processing times and multiple due datesen_US
dc.typeArticleen_US
dc.departmentDepartment of Industrial Engineering
dc.citation.spage6087en_US
dc.citation.epage6111en_US
dc.citation.volumeNumber46en_US
dc.citation.issueNumber21en_US
dc.identifier.doi10.1080/00207540701262913en_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