JIT条件下最小库存费用车间作业排序  

Research on Job Shop Scheduling Using the JIT Technique

作　　者：崔路军[1] 王炬香[1] 

机构地区：[1]青岛大学管理科学与工程系,青岛266071

出　　处：《科学技术与工程》2009年第19期5875-5877,5886,共4页Science Technology and Engineering

基　　金：国际自然科学基金(70671056)资助;山东自然科学基金(Q2006H01)资助

摘　　要：准时制生产意义下的作业车间调度问题,是当前作业生产排序研究领域的一个重要的方面。针对单机作业准时制生产方式,研究了不允许出现缺货条件下的作业车间生产排序问题,目标是使得总成本最小,目标函数只考虑库存费用的大小,对所有未按照准时生产的任务都进行一定的惩罚,利用改进的模拟退火算法求出最优的排序方案,应用实例说明了该算法的正确性与有效性。The problem of job shop scheduling using the JIT technique plays an important role in several production systems. A scheduling model is considered in which several jobs need to be processed by a single machine, During processing. No delayed delivery are allowed. So only premature delivery and delivery on time are to be considered. The target is to minimize the total cost. The objective function just considered the cost of inventory. There is a punitive quotiety to any premature deliery. At last, the optimalizing job shop scheduling would got using simulated annealing algorithm. The results of experiment show the algorithm is efficient.

关 键 词：准时生产 作业车间调度 改进的模拟退火算法 

分 类 号：TP391.78[自动化与计算机技术—计算机应用技术]