An asymptotically optimal algorithm for large-scale mixed job shop scheduling to minimize the makespan

doi:10.1007/s10878-015-9974-7

CORC > 上海财经大学 > 上海财经大学

	An asymptotically optimal algorithm for large-scale mixed job shop scheduling to minimize the makespan
	Gu, Manzhan 1,4; Lu, Xiwen 2; Gu, Jinwei 3,5
刊名	JOURNAL OF COMBINATORIAL OPTIMIZATION
	2017-02
卷号	33 期号:2 页码:473-495
关键词	Job shop Makespan Batch machine Flexible machine Available constrain
ISSN号	1382-6905
DOI	10.1007/s10878-015-9974-7
英文摘要	This paper considers the large-scale mixed job shop scheduling problem with general number of jobs on each route. The problem includes ordinary machines, batch machines (with bounded or unbounded capacity), parallel machines, and machines with breakdowns. The objective is to find a schedule to minimize the makespan. For the problem, we define a virtual problem and a corresponding virtual schedule, based on which our algorithm TVSA is proposed. The performance analysis of the algorithm shows the gap between the obtained solution and the optimal solution is O(1), which indicates the algorithm is asymptotically optimal.
WOS研究方向	Computer Science ; Mathematics
语种	英语
出版者	SPRINGER
WOS记录号	WOS:000394241000007
内容类型	期刊论文
源URL	[http://10.2.47.112/handle/2XS4QKH4/1050]
专题	上海财经大学
通讯作者	Gu, Jinwei
作者单位	1.Shandong Univ, Sch Math & Stat, Weihai 264209, Shandong, Peoples R China; 2.East China Univ Sci & Technol, Dept Math, Shanghai 200237, Peoples R China; 3.Shandong Univ, Sch Mech Elect & Informat Engn, Weihai 264209, Shandong, Peoples R China; 4.Shanghai Univ Finance & Econ, Sch Math, Shanghai 200433, Peoples R China; 5.Shanghai Univ Elect Power, Coll Econ & Management, Shanghai 200090, Peoples R China
推荐引用方式 GB/T 7714	Gu, Manzhan,Lu, Xiwen,Gu, Jinwei. An asymptotically optimal algorithm for large-scale mixed job shop scheduling to minimize the makespan[J]. JOURNAL OF COMBINATORIAL OPTIMIZATION,2017,33(2):473-495.
APA	Gu, Manzhan,Lu, Xiwen,&Gu, Jinwei.(2017).An asymptotically optimal algorithm for large-scale mixed job shop scheduling to minimize the makespan.JOURNAL OF COMBINATORIAL OPTIMIZATION,33(2),473-495.
MLA	Gu, Manzhan,et al."An asymptotically optimal algorithm for large-scale mixed job shop scheduling to minimize the makespan".JOURNAL OF COMBINATORIAL OPTIMIZATION 33.2(2017):473-495.