Minimization of maximum lateness in an m-machine permutation flow shop   with a general exponential learning effect

doi:10.1016/j.cie.2016.04.010

CORC > 北京大学 > 工学院

	Minimization of maximum lateness in an m-machine permutation flow shop with a general exponential learning effect
	He, Hongyu
刊名	COMPUTERS & INDUSTRIAL ENGINEERING
	2016
关键词	Scheduling Flow shop Learning effect Branch and bound Heuristic algorithm Nested Partition (NP) WORST-CASE ANALYSIS SINGLE-MACHINE SCHEDULING PROBLEMS LINEAR DETERIORATION 2-MACHINE FLOWSHOP SETUP TIMES MAKESPAN CURVE
DOI	10.1016/j.cie.2016.04.010
英文摘要	In this paper, we consider the permutation flow shop scheduling problem with a general exponential learning effect. The objective is to minimize the maximum lateness. A special case that can be solved to optimality by EDD algorithm is provided. To form a hybrid solution framework, several heuristics, a branch-and-bound algorithm and a new Nested-Partition-based solution approach are proposed. Composite bounds and dominance rules are developed to reduce the searching region and to provide guidance on the lower bound. Finally, computational experiments are conducted to evaluate the performance of the algorithms. (C) 2016 Elsevier Ltd. All rights reserved.; SCI(E); EI; ARTICLE; hehongyu@pku.edu.cn; 73-83; 97
语种	英语
内容类型	期刊论文
源URL	[http://ir.pku.edu.cn/handle/20.500.11897/437097]
专题	工学院
推荐引用方式 GB/T 7714	He, Hongyu. Minimization of maximum lateness in an m-machine permutation flow shop with a general exponential learning effect[J]. COMPUTERS & INDUSTRIAL ENGINEERING,2016.
APA	He, Hongyu.(2016).Minimization of maximum lateness in an m-machine permutation flow shop with a general exponential learning effect.COMPUTERS & INDUSTRIAL ENGINEERING.
MLA	He, Hongyu."Minimization of maximum lateness in an m-machine permutation flow shop with a general exponential learning effect".COMPUTERS & INDUSTRIAL ENGINEERING (2016).