一类线性加工时间单机调度问题(英文版)(pdf 6页)
一类线性加工时间单机调度问题(英文版)(pdf 6页)内容简介
一类线性加工时间单机调度问题(英文版)内容提要:
Introduction:
Machine scheduling problems with job processing time given as a starting time de-
pendent function have received increasing attention in recent yearst'}. In this model, the
processing time of a job can be described by a basic processing time and an increasing rate.
Gupta and Gupta were the first to consider the problem of this typef=3. Mosheiov studied
some special cases of this models,一,〕.Bachman and J aniak proved that the problem to min-
imize the maximum lateness with an arbitrary linear processing time is NP-complete'st.
..............................
Introduction:
Machine scheduling problems with job processing time given as a starting time de-
pendent function have received increasing attention in recent yearst'}. In this model, the
processing time of a job can be described by a basic processing time and an increasing rate.
Gupta and Gupta were the first to consider the problem of this typef=3. Mosheiov studied
some special cases of this models,一,〕.Bachman and J aniak proved that the problem to min-
imize the maximum lateness with an arbitrary linear processing time is NP-complete'st.
..............................
用户登陆
管理知识热门资料
管理知识相关下载