Now showing items 1-4 of 4
A new bounding mechanism for the CNC machine scheduling problems with controllable processing times
In 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 ...
Considering manufacturing cost and scheduling performance on a CNC turning machine
A well known industry application that allows controllable processing times is the manufacturing operations on CNC machines. For each turning operation as an example, there is a nonlinear relationship between the manufacturing ...
Single CNC machine scheduling with controllable processing times and multiple due dates
(Taylor & Francis, 2008)
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 ...
Predictive/reactive scheduling with controllable processing times and earliness-tardiness penalties
(Taylor & Francis, 2009)
In this study, a machine scheduling problem with controllable processing times in a parallel-machine environment is considered. The objectives are the minimization of manufacturing cost, which is a convex function of ...