摘要
准时生产意义下的调度问题 ,是当前调度领域研究的一个主要方面 .针对单机分批作业准时生产方式 ,研究了不允许出现拖期的批调度问题 ,目标是使得加工总成本最小 ,目标函数不仅考虑了提前惩罚 ,还考虑了机器的加工费用 .为了确定最优分批与各批次的开始时间 ,给出了两个推理和三个规则 ,并根据推理及规则给出了一个有效的启发式算法 ,使得目标函数最小 .
Batch scheduling plays an important role in several production systems, such as heat treating, plating bath and semiconductor manufacturing. In this paper, we consider a scheduling model in which several batches of jobs need to be processed by a single machine. During processing, no tardiness jobs are allowed, so only earliness penalties and the machine processing cost are to be considered, the objective of which is to minimize the processing cost. To solve this problem, we provide two lemmas and three rules about batching jobs and deciding the start time of each batch, on the basis of which a heuristic algorithm is put forward. The results of experiment show the algorithm is efficient.
出处
《西安电子科技大学学报》
EI
CAS
CSCD
北大核心
2002年第4期444-446,460,共4页
Journal of Xidian University
基金
国家自然科学基金资助项目 (699840 0 4)
863计划资助项目 (2 0 0 1AA412 15 0 )
航空基金资助项目 (0 1H5 3 0 61)