Minimizing Completion Time for Order Scheduling: Formulation and   Heuristic Algorithm

doi:10.1109/TASE.2015.2456131

CORC > 北京大学 > 工学院

	Minimizing Completion Time for Order Scheduling: Formulation and Heuristic Algorithm
	Shi, Zhongshun ; Wang, Longfei ; Liu, Pai ; Shi, Leyuan
刊名	IEEE TRANSACTIONS ON AUTOMATION SCIENCE AND ENGINEERING
	2017
关键词	Completion time hybrid nested partitions linearization order scheduling NESTED PARTITIONS METHOD MULTIPLE PRODUCT TYPES SINGLE-MACHINE CUSTOMER ORDERS JOB OPTIMIZATION TARDINESS PARALLEL
DOI	10.1109/TASE.2015.2456131
英文摘要	In this study, the customer order scheduling problem is investigated to minimize total weighted completion time. A quadratic formulation is proposed to address this problem. This formulation is converted into an equivalent mixed-integer linear programming model by applying the linearization technique and the special structure of the problem. The problem size that can be solved to optimality is then investigated and reported based on the final linearized formulation. Furthermore, a hybrid nested partitions algorithm is developed to solve large-scale problems. Numerical results illustrate the advantages of the proposed model and demonstrate that the proposed algorithm can obtain high-quality solutions within a reasonable computational time. Note to Practitioners-At present, many manufacturing enterprises are adopting the multi-variety and small batch manufacturing mode. In this mode, every customer order consists of different product types, and the entire order should be delivered simultaneously. Thus, committing a delivery due date for an order and increasing the utilization rate of manufacturing resources are key issues among manufacturing managers. This study presents an efficient linearized model to address the aforementioned problem. A hybrid nested partitions-based algorithm is designed and implemented to solve large-scale problem instances. An advantage of the proposed algorithm is that it can be potentially extended by incorporating domain knowledge and management experience. This approach indicates that several specific rules or techniques can be used when designing and implementing algorithms to improve efficiency.; National Science Foundation of China (NSFC) [71371015]; Special Research Funds in Public Welfare Sector of China [201313009-7, 201413003]; Special Funds of National Science and Technology Support Plan of China [2013BAD17B08]; SCI(E); ARTICLE; 4; 1558-1569; 14
语种	英语
内容类型	期刊论文
源URL	[http://ir.pku.edu.cn/handle/20.500.11897/470573]
专题	工学院
推荐引用方式 GB/T 7714	Shi, Zhongshun,Wang, Longfei,Liu, Pai,et al. Minimizing Completion Time for Order Scheduling: Formulation and Heuristic Algorithm[J]. IEEE TRANSACTIONS ON AUTOMATION SCIENCE AND ENGINEERING,2017.
APA	Shi, Zhongshun,Wang, Longfei,Liu, Pai,&Shi, Leyuan.(2017).Minimizing Completion Time for Order Scheduling: Formulation and Heuristic Algorithm.IEEE TRANSACTIONS ON AUTOMATION SCIENCE AND ENGINEERING.
MLA	Shi, Zhongshun,et al."Minimizing Completion Time for Order Scheduling: Formulation and Heuristic Algorithm".IEEE TRANSACTIONS ON AUTOMATION SCIENCE AND ENGINEERING (2017).