Single CNC machine scheduling with controllable processing times to minimize total weighted tardiness

Advanced manufacturing technologies, such as CNC machines, require significant investments, but also offer new capabilities to the manufacturers. One of the important capabilities of a CNC machine is the controllable processing times. By using this capability, the due date requirements of customers can be satisfied much more effectively. Processing times of the jobs on a CNC machine can be easily controlled via machining conditions such that they can be increased or decreased at the expense of tooling cost. Since scheduling decisions are very sensitive to the processing times, we solve the process planning and scheduling problems simultaneously. In this study, we consider the problem of scheduling a set of jobs on a single CNC machine to minimize the sum of total weighted tardiness, tooling and machining costs. We formulated the joint problem, which is NP-hard since the total weighted tardiness problem (with fixed processing times) is strongly NP-hard alone, as a nonlinear mixed integer program. We proposed a DP-based heuristic to solve the problem for a given sequence and designed a local search algorithm that uses it as a base heuristic.

[1]  R. G. Vickson,et al.  Choosing the Job Sequence and Processing Times to Minimize Total Processing Plus Flow Cost on a Single Machine , 1980, Oper. Res..

[2]  R. Storer,et al.  A problem space algorithm for single machine weighted tardiness problems , 2003 .

[3]  Sinan Gürel,et al.  Production, Manufacturing and Logistics Considering manufacturing cost and scheduling performance on a CNC turning machine , 2007 .

[4]  Dvir Shabtay,et al.  Minimizing the total weighted flow time in a single machine with controllable processing times , 2004, Comput. Oper. Res..

[5]  Abdulrahman Al-Ahmari,et al.  Computer aided optimization of scheduling and machining parameters in job shop manufacturing systems , 2002 .

[6]  Chao-Tang Tseng,et al.  Minimizing total tardiness on a single machine with controllable processing times , 2009, Comput. Oper. Res..

[7]  N. Jawahar,et al.  Hybrid heuristic algorithms for single machine total weighted tardiness scheduling problems , 2008, Int. J. Intell. Syst. Technol. Appl..

[8]  John M. Wilson,et al.  Comparing efficiencies of genetic crossover operators for one machine total weighted tardiness problem , 2008, Appl. Math. Comput..

[9]  Michael Pinedo,et al.  Scheduling: Theory, Algorithms, and Systems , 1994 .

[10]  Xianpeng Wang,et al.  A population-based variable neighborhood search for the single machine total weighted tardiness problem , 2009, Comput. Oper. Res..

[11]  Chung-Lun Li,et al.  Parallel-machine scheduling with controllable processing times , 1996 .

[12]  Dvir Shabtay,et al.  A bicriteria approach to minimize maximal lateness and resource consumption for scheduling a single machine , 2007, J. Sched..

[13]  R. Storer,et al.  New search spaces for sequencing problems with application to job shop scheduling , 1992 .

[14]  Dvir Shabtay,et al.  A survey of scheduling with controllable processing times , 2007, Discret. Appl. Math..

[15]  E. Lawler.  A “Pseudopolynomial” Algorithm for Sequencing Jobs to Minimize Total Tardiness , 1977 .

[16]  TsengChao-Tang,et al.  Minimizing total tardiness on a single machine with controllable processing times , 2009 .

[17]  M. Selim Akturk,et al.  A new bounding mechanism for the CNC machine scheduling problems with controllable processing times , 2005, Eur. J. Oper. Res..

[18]  Zuren Feng,et al.  A tabu-search algorithm for scheduling jobs with controllable processing times on a single machine to meet due-dates , 2010, Comput. Oper. Res..