Considering manufacturing cost and scheduling performance on a computer-numerically-controlled turning machine

Considering manufacturing cost and scheduling performance on a computer-numerically-controlled turning machine

0.00 Avg rating0 Votes
Article ID: iaor20084385
Country: Netherlands
Volume: 177
Issue: 1
Start Page Number: 325
End Page Number: 343
Publication Date: Feb 2007
Journal: European Journal of Operational Research
Authors: ,
Keywords: programming: multiple criteria
Abstract:

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 cost and its required processing time on a CNC turning machine. If we consider total manufacturing cost (F1) and total weighted completion time (F2) objectives simultaneously on a single CNC machine, making appropriate processing time decisions is as critical as making job sequencing decisions. We first give an effective model for the problem of minimizing F1 subject to a given F2 level. We deduce some optimality properties for this problem. Based on these properties, we propose a heuristic algorithm to generate an approximate set of efficient solutions. Our computational results indicate that the proposed algorithm performs better than the GAMS/MINOS commercial solver both in terms of solution quality and computational requirements such that the average CPU time is only 8% of the time required by the GAMS/MINOS.

Reviews

Required fields are marked *. Your email address will not be published.