A note on resource allocation scheduling with group technology and   learning effects on a single machine

doi:10.1080/0305215X.2016.1265305

CORC > 北京大学 > 工学院

	A note on resource allocation scheduling with group technology and learning effects on a single machine
	Lu, Yuan-Yuan ; Wang, Ji-Bo ; Ji, Ping ; He, Hongyu
刊名	ENGINEERING OPTIMIZATION
	2017
关键词	Scheduling learning effect resource allocation group technology heuristic algorithm CONTROLLABLE PROCESSING TIMES ASSIGNMENT POSITION OPTIMIZATION
DOI	10.1080/0305215X.2016.1265305
英文摘要	In this article, single-machine group scheduling with learning effects and convex resource allocation is studied. The goal is to find the optimal job schedule, the optimal group schedule, and resource allocations of jobs and groups. For the problem of minimizing the makespan subject to limited resource availability, it is proved that the problem can be solved in polynomial time under the condition that the setup times of groups are independent. For the general setup times of groups, a heuristic algorithm and a branch-and-bound algorithm are proposed, respectively. Computational experiments show that the performance of the heuristic algorithm is fairly accurate in obtaining near-optimal solutions.; National Natural Science Foundation of China [71471120, 71501082]; SCI(E); ARTICLE; 9; 1621-1632; 49
语种	英语
内容类型	期刊论文
源URL	[http://ir.pku.edu.cn/handle/20.500.11897/475942]
专题	工学院
推荐引用方式 GB/T 7714	Lu, Yuan-Yuan,Wang, Ji-Bo,Ji, Ping,et al. A note on resource allocation scheduling with group technology and learning effects on a single machine[J]. ENGINEERING OPTIMIZATION,2017.
APA	Lu, Yuan-Yuan,Wang, Ji-Bo,Ji, Ping,&He, Hongyu.(2017).A note on resource allocation scheduling with group technology and learning effects on a single machine.ENGINEERING OPTIMIZATION.
MLA	Lu, Yuan-Yuan,et al."A note on resource allocation scheduling with group technology and learning effects on a single machine".ENGINEERING OPTIMIZATION (2017).