Single CNC machine scheduling with controllable processing times and multiple due dates
Atan, M. O.
Akturk, M. S.
International Journal of Production Research
Taylor & Francis
6087 - 6111
Item Usage Stats
MetadataShow full item record
In 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.
Total weighted tardiness and earliness
Multiple due dates
Controllable processing times