摘要
针对单机和两台机器的平行机排序问题,建立了工件同时具有学习效应和恶化效应,机器有可用性限制的排序模型.考虑了目标函数为极小化总完工时间的单机、两台机器的同型机问题和两台机器的同类机问题.对于机器在任意时间进行维修的一般情况给出了动态规划算法,通过数值例子说明了算法的有效性,对机器在使用前进行维修的特殊情况给出了多项式算法.
Aiming at the scheduling problems of the single machine and two parallel machines,a model of scheduling problems of availability constraint with learning and deteriorating effect.By the learning and deteriorating effect,the processing time of jobs is defined as the function of their positions in a sequence,and the jobs to be processed on the same machine,their actual processing time is gradually reduced along with the order of their positions.Moreover,the machine could be unavailable for a specified period of time by periodic machine maintenance activity.That the objective function is to minimize the total completion time of single machine problems,two identical machines and two uniform machines is considered.A dynamic programming algorithm is provided for the machine maintenance in a common case at any time,and the validity of the algorithm is also illustrated by an example.A polynomial algorithm is given for the maintenance before the use of the machine in the special case.
出处
《枣庄学院学报》
2010年第5期28-35,共8页
Journal of Zaozhuang University
基金
国家自然科学基金(10671108)
山东自然科学基金(Y2005A04)
曲阜师范大学科研基金资助项目(XJZ200849)
关键词
排序
可用性限制
学习效应
恶化效应
动态规划
scheduling
availability constraint
learning effect
dynamic programming
assignment problem