QQ客服 官方微博 反馈留言

	A novel quadratic formulation for customer order scheduling problem
	Wang, Longfei ; Shi, Zhongshun ; Shi, Leyuan
	2013
DOI	10.1109/CoASE.2013.6654049
英文摘要	In this paper, we consider a customer order scheduling problem, in which there are n orders from n different customers, and each customer order consists of one or more jobs of different types, and each kind of jobs can be only processed on one machine. The objective is to minimize the total weighted completion time of the orders. We propose a novel quadratic formulation for this problem, then we transform the quadratic model into an equivalent mixed-integer linear programming model through using the standard linearization technique. Also, by exploiting the special structure of this problem, some variables and constrains are eliminated to reduce the problem size. The final linearized model can be solved by commercial software directly, and some computational experiments are designed and conducted to test the effectiveness and efficiency of the model. ? 2013 IEEE.; EI; 0
语种	英语
内容类型	会议论文
源URL	[http://ir.pku.edu.cn/handle/20.500.11897/410802]
专题	工学院
推荐引用方式 GB/T 7714	Wang, Longfei,Shi, Zhongshun,Shi, Leyuan. A novel quadratic formulation for customer order scheduling problem[C]. 见:.

个性服务

查看访问统计

相关权益政策

暂无数据

收藏/分享

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