期刊文献+

SINGLE MACHINE SCHEDULING WITH CONTROLLABLE PROCESSING TIMES AND COMPRESSION COSTS : PROOF OF THEOREMS

SINGLE MACHINE SCHEDULING WITH CONTROLLABLE PROCESSING TIMES AND COMPRESSION COSTS:PROOF OF THEOREMS
全文增补中
导出
摘要 Abstract This report is virtually the appendix part of the author's previous paper which includes the proofs for the theorems and lemmas. Abstract This report is virtually the appendix part of the author's previous paper which includes the proofs for the theorems and lemmas.
出处 《Applied Mathematics(A Journal of Chinese Universities)》 SCIE CSCD 1998年第4期427-436,共10页 高校应用数学学报(英文版)(B辑)
关键词 Machine scheduling problems controllable processing times uniform compression time and cost dominance set lateness crash activities polynomial time algorithm Machine scheduling problems controllable processing times uniform compression time and cost dominance set lateness crash activities polynomial time algorithm
  • 相关文献

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部