QQ客服 官方微博 反馈留言

	Single machine scheduling to minimize total weighted tardiness (EI收录)
	Cheng, T.C.E.[1]; Ng, C.T.[1]; Yuan, J.J.[1,2]; Liu, Z.H.[1,3]
会议名称	European Journal of Operational Research
关键词	Algorithms Approximation theory Dynamic programming Functions Mathematical models Polynomials Theorem proving
URL标识	查看原文
内容类型	会议论文
URI标识	http://www.corc.org.cn/handle/1471x/2117085
专题	华南理工大学
作者单位	1.[1] Department of Logistics, Hong Kong Polytechnic University, Hung Hom, Kowloon, Hong Kong 2.[2] Department of Mathematics, Zhengzhou University, Zhengzhou, Henan 450052, China 3.[3] Department of Mathematics, E. China Univ. of Sci. and Technol., Shanghai 200237, China
推荐引用方式 GB/T 7714	Cheng, T.C.E.[1],Ng, C.T.[1],Yuan, J.J.[1,2],等. Single machine scheduling to minimize total weighted tardiness (EI收录)[C]. 见:European Journal of Operational Research.

个性服务

查看访问统计

相关权益政策

暂无数据

收藏/分享

除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。