On-line scheduling of small open shops

CSpace

	On-line scheduling of small open shops
	Chen, B ; Du, D ; Han, J ; Wen, JJ
	2001-06-15
发表期刊	DISCRETE APPLIED MATHEMATICS
ISSN	0166-218X
卷号	110 期号:2-3 页码:133-150
摘要	We investigate the problem of on-line scheduling open shops of two and three machines with an objective of minimizing the schedule makespan. We first propose a 1.848-competitive permutation algorithm for the non-preemptive scheduling problem of two machines and show that no permutation algorithm can be better than 1.754-competitive. Secondly, we develop a (27/19)-competitive algorithm for the preemptive scheduling problem of three machines, which is most competitive. (C) 2001 Elsevier Science B.V. All rights reserved.
关键词	scheduling on-line open shop preemption competitive analysis
语种	英语
WOS研究方向	Mathematics
WOS类目	Mathematics, Applied
WOS记录号	WOS:000168632400004
出版者	ELSEVIER SCIENCE BV
引用统计
文献类型	期刊论文
条目标识符	http://ir.amss.ac.cn/handle/2S8OKBNM/15971
专题	中国科学院数学与系统科学研究院
通讯作者	Chen, B
作者单位	1.Univ Warwick, Warwick Business Sch, Coventry CV4 7AL, W Midlands, England 2.Univ Texas, Sch Management, Richardson, TX 75083 USA 3.Chinese Acad Sci, Inst Appl Math, Beijing 100080, Peoples R China 4.Univ Calif Riverside, Dept Comp Sci, Riverside, CA 92521 USA
推荐引用方式 GB/T 7714	Chen, B,Du, D,Han, J,et al. On-line scheduling of small open shops[J]. DISCRETE APPLIED MATHEMATICS,2001,110(2-3):133-150.
APA	Chen, B,Du, D,Han, J,&Wen, JJ.(2001).On-line scheduling of small open shops.DISCRETE APPLIED MATHEMATICS,110(2-3),133-150.
MLA	Chen, B,et al."On-line scheduling of small open shops".DISCRETE APPLIED MATHEMATICS 110.2-3(2001):133-150.