| 带调整时间的一类排序问题 |
| |
| 引用本文： | 刘静.带调整时间的一类排序问题[J].数学的实践与认识,2006,36(5):267-272. |
| |
| 作者姓名： | 刘静 |
| |
| 作者单位： | 嘉兴学院数学系,浙江,嘉兴,314001 |
| |
| 基金项目： | 嘉兴学院校科研和教改项目 |
| |
| 摘 要： | 进一步讨论带磨损因子的排序问题,在相应问题中对工件j,j=1,2,…,n,引入了调整时间sj,它同磨损因子bj一样同该工件何时加工无关.要求适当排列这n个工件的加工顺序,使目标函数值达最小.给出了加工全程、完工时间之和及JIT问题在引入调整时间下的最优算法.
|
| 关 键 词： | 排序 调整时间 磨损因子 最优算法 |
| 修稿时间： | 2005年11月1日 |
Scheduling Problems with Adjusted Time |
| |
| LIU Jing.Scheduling Problems with Adjusted Time[J].Mathematics in Practice and Theory,2006,36(5):267-272. |
| |
| Authors: | LIU Jing |
| |
| Abstract: | This paper consider further the scheduling problems with wearing effect,In the correspond scheduling problems,we enter adjusted time s_j for job j,j=1,2,…,n.It is independent of the jobs whose processing times as the wearing effect b_j.We are asked to sequence the n jobs in such a way that objective functions are minimized.For the following three objective functions: the makespan,the total completion time and JIT problem,This paper constructs the optimal sequence when enter adjusted time respectively. |
| |
| Keywords: | scheduling adjusted time wearing effect optimal algorithm |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
|
