Flexible Assembly Job-Shop Scheduling With Sequence-Dependent Setup Times and Part Sharing in a Dynamic Environment: Constraint Programming Model, Mixed-Integer Programming Model, and Dispatching Rules

doi:10.1109/TEM.2017.2785774

CORC > 数学与系统科学研究院 > 中国科学院数学与系统科学研究院 > 系统科学研究所

	Flexible Assembly Job-Shop Scheduling With Sequence-Dependent Setup Times and Part Sharing in a Dynamic Environment: Constraint Programming Model, Mixed-Integer Programming Model, and Dispatching Rules
	Zhang, Sicheng 1; Wang, Shouyang2
刊名	IEEE TRANSACTIONS ON ENGINEERING MANAGEMENT
	2018-08-01
卷号	65 期号:3 页码:487-504
关键词	Assembly job-shop scheduling constraint programming (CP) dynamic scheduling flexible job-shop scheduling mixed-integer linear programming (MILP)
ISSN号	0018-9391
DOI	10.1109/TEM.2017.2785774
英文摘要	This paper studies the flexible assembly job-shop scheduling problem in a dynamic manufacturing environment, which is an exension of job-shop scheduling with incorporation of serveral types of flexibilies and integration of an assembly stage. Each product is assembled from several parts with nonlinear process plans with operations involving alternative machines. Setup times are sequence dependent and serparately considered from processing times. Part sharing is fully allowed such that they can he used for the assembly of any passible product, rather than being preassociated to a specfic product. We employ constraint programming and mixed-integer linear programming to formulate the problem. Besides, several dispatching rules with machine feedback machanism are developped. Experimental studies are conducted based on test case problems with different scales and complexities. It is found that constraint programming is the most efficacious approach, whose solution fitness outperforms mixed-integer linear programming as well as all dispatching rules in both static and dynamic cases. On the other hand, dispatching rules are simple to implement, among which the "earliest completion time" rule is the most favourable. A real-time scheduling/rescheduling system has been constructed for the implementation of the proposed approaches to solve practical problems in production.
WOS研究方向	Business & Economics ; Engineering
语种	英语
出版者	IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
WOS记录号	WOS:000439383600012
内容类型	期刊论文
源URL	[http://ir.amss.ac.cn/handle/2S8OKBNM/33435]
专题	系统科学研究所
通讯作者	Zhang, Sicheng
作者单位	1.Chinese Acad Sci, Acad Math & Syst Sci, Beijing 100190, Peoples R China 2.Chinese Acad Sci, Acad Math & Syst Sci, Inst Syst Sci, Beijing, Peoples R China
推荐引用方式 GB/T 7714	Zhang, Sicheng,Wang, Shouyang. Flexible Assembly Job-Shop Scheduling With Sequence-Dependent Setup Times and Part Sharing in a Dynamic Environment: Constraint Programming Model, Mixed-Integer Programming Model, and Dispatching Rules[J]. IEEE TRANSACTIONS ON ENGINEERING MANAGEMENT,2018,65(3):487-504.
APA	Zhang, Sicheng,&Wang, Shouyang.(2018).Flexible Assembly Job-Shop Scheduling With Sequence-Dependent Setup Times and Part Sharing in a Dynamic Environment: Constraint Programming Model, Mixed-Integer Programming Model, and Dispatching Rules.IEEE TRANSACTIONS ON ENGINEERING MANAGEMENT,65(3),487-504.
MLA	Zhang, Sicheng,et al."Flexible Assembly Job-Shop Scheduling With Sequence-Dependent Setup Times and Part Sharing in a Dynamic Environment: Constraint Programming Model, Mixed-Integer Programming Model, and Dispatching Rules".IEEE TRANSACTIONS ON ENGINEERING MANAGEMENT 65.3(2018):487-504.