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 efficient frontier for a bi-criteria scheduling problem on a single CNC machine. We have two objectives; minimizing the manufacturing cost (comprised of machining and tooling costs) and minimizing makespan. The technological restrictions of the CNC machine along with the job specific parameters affect the machining conditions; such as cutting speed and feed rate, which in turn specify the processing times and tool lives. Since it is well known that scheduling problems are extremely sensitive to processing time data, system resources can be utilized much more efficiently by selecting processing times appropriately.

[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]  S. S. Panwalkar,et al.  Single-machine sequencing with controllable processing times , 1992 .

[3]  Eugeniusz Nowicki,et al.  A survey of results for sequencing problems with controllable processing times , 1990, Discret. Appl. Math..

[4]  M. Selim Akturk,et al.  Theory and Methodology Tool allocation and machining conditions optimization for CNC machines , 1996 .

[5]  Panagiotis Kouvelis,et al.  Flow-line scheduling problems with controllable processing times , 1997 .

[6]  Joseph B. Mazzola,et al.  Scheduling Parallel Manufacturing Cells with Resource Flexibility , 1996 .

[7]  M. Selim Akturk,et al.  Joint lot sizing and tool management in a CNC environment , 1999 .

[8]  Fryderyk E. Gorczyca.  Application of metal cutting theory , 1987 .

[9]  Jean-Charles Billaut,et al.  Multicriteria scheduling , 2005, Eur. J. Oper. Res..

[10]  Stanisaw Zdrzaka,et al.  Scheduling jobs on a single machine with release dates, delivery times and controllable processing times: worst-case analysis , 1991 .

[11]  Eugeniusz Nowicki,et al.  A Bicriterion Approach to Preemptive Scheduling of Parallel Machines with Controllable Job Processing Times , 1995, Discret. Appl. Math..

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

[13]  Michael A. Trick,et al.  Scheduling Multiple Variable-Speed Machines , 1990, Oper. Res..

[14]  Behnam Malakooti,et al.  An Interactive Multiple Criteria Approach for Parameter Selection in Metal Cutting , 1989, Oper. Res..