英语翻译Scheduling parallel CNCmachines with time/cost trade-off

英语翻译
Scheduling parallel CNCmachines with time/cost trade-off considerations
Sinan Gurel and M.Selim Akturk
aDepartment of Industrial Engineering,Bilkent University,06800 Ankara,Turkey
Available online 15 December 2005.
Abstract
When the processing times of jobs are controllable,selected processing times affect both the manufacturing cost and the scheduling performance.A well-known example for such a case that this paper specifically deals with is the turning operation on a CNC machine.Manufacturing cost of a turning operation is a nonlinear convex function of its processing time.We also know that scheduling decisions are quite sensitive to the processing times.Therefore,this paper considers minimizing total manufacturing cost (F1) and total completion time (F2) objectives simultaneously on identical parallel CNC turning machines.Since decreasing processing time of a job increases its manufacturing cost,we cannot minimize both objectives at the same time,so the problem is to generate non-dominated solutions.We consider the problem of minimizing F1 subject to a given F2 level and give an effective formulation for the problem.For this problem,we prove some optimality properties which facilitated designing an efficient heuristic algorithm to generate approximate non-dominated solutions.Computational results show that proposed algorithm performs almost equal with the GAMS/MINOS commercial solver although it spends much less computation time.

摘要 在加工时的职位是可控的,挑选加工,有时会影响到双方的制造成本和调度表现.一个著名的例子,对于这种情况,本文特别针对的是车削加工,在数控 机.制造成本的一个车削是一种非线性凸函数的处理时间.我们也知道,调度决策是相当敏感的加工时间.因此,本文认为减少总造价( F1 )和总完工时间( F2 )的目标,同时在平行车削 机器.由于减少了工件加工时间增加其制造成本,我们不能低估这两个目标的同时,使问题是生成非劣解.我们考虑的问题,最大限度的F1受某一F2水平,并给予有效的配方为:问题.对于这个问题,我们证明了最优性能有助于设计一个有效的启发式算法产生的近似非劣解.计算结果表明,算法的性能几乎相等同 minos商业解题虽然花费少得多的计算 时间.