Single CNC machine scheduling with controllable processing times and multiple due dates

Simple item page
buir.advisorAktürk, M. Selim
dc.contributor.authorAtan, Mehmet Oğuz
dc.date.accessioned2016-07-01T11:01:06Z
dc.date.available2016-07-01T11:01:06Z
dc.date.issued2004
dc.departmentDepartment of Industrial Engineeringen_US
dc.descriptionCataloged from PDF version of article.en_US
dc.description.abstractIn order to reflect the characteristics of a modern manufacturing environment, elements of customer satisfaction and the competition between firms should be considered simultaneously. Manufacturers should be careful on deciding which orders to accept, and should pay attention on the weighted earliness and tardiness penalties they will be due, while considering the priorities of the customers. Customers that want to minimize the risk of deviation from a delivery date, offer multiple due dates to the manufacturer, each coming with a distinct price for the order that is decreasing as the date gets later. Manufacturers that use flexible manufacturing systems have the capability to control the processing times of jobs, by changing the machining conditions at the expense of tooling costs. In this study, we consider the problem of scheduling a set of jobs on a single CNC machine, while maximizing the total profit that is composed of sum of prices of scheduled jobs less the sum of total weighted earliness/tardiness cost, tooling cost and machining cost. This problem is NP-hard since the total weighted tardiness problem is NP-hard alone. Furthermore, because of the nature of the tooling cost, the problem is nonlinear. We propose a number of ranking rules and scheduling algorithms. Using these rules and algorithms, we construct a single-pass heuristic algorithm that determines the processing times for each job and schedules them simultaneously, to maximize the overall profit.en_US
dc.description.degreeM.S.en_US
dc.description.statementofresponsibilityAtan, Mehmet Oğuzen_US
dc.format.extentxiii, 205 leavesen_US
dc.identifier.itemidBILKUTUPB026238
dc.identifier.urihttp://hdl.handle.net/11693/29540
dc.language.isoEnglishen_US
dc.publisherBilkent Universityen_US
dc.rightsinfo:eu-repo/semantics/openAccessen_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.subjectSingle Machineen_US
dc.subject.lccTS157.5 .A83 2004en_US
dc.subject.lcshScheduling (Management) Mathematical models.en_US
dc.titleSingle CNC machine scheduling with controllable processing times and multiple due datesen_US
dc.typeThesisen_US

Files

Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
0002631.pdf
Size:
3.26 MB
Format:
Adobe Portable Document Format
Description:
Full printable version
Download

Collections

Dept. of Industrial Engineering - Master's degree