Single CNC machine scheduling with controllable processing times to minimize total weighted tardiness
Computers and Operations Research
MetadataShow full item record
Please cite this item using this persistent URLhttp://hdl.handle.net/11693/21977
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. © 2010 Elsevier Ltd. All rights reserved.
- Research Paper 7144
Showing items related by title, author, creator and subject.
A beam search algorithm to optimize robustness under random machine breakdowns and processing time variability Goren, S.; Sabuncuoglu I. (2007)The vast majority of the machine scheduling research assumes complete information about the scheduling problem and a static environment in which scheduling systems operate. In practice, however, scheduling systems are ...
Predictive/reactive scheduling with controllable processing times and earliness-tardiness penalties Turkcan, A.; Akturk, M.S.; Storer, R.H. (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 ...
Yildiz, S.; Akturk, M.S.; Karasan O.E. (2011)The current study deals with a bicriteria scheduling problem arising in an m-machine robotic cell consisting of CNC machines producing identical parts. Such machines by nature possess the process flexibility of altering ...