Multi-degree cyclic hoist scheduling with time window constraints

作     者：Che, Ada Zhou, Zhen Chu, Chengbin Chen, Haoxun 

作者机构：NW Polytech Univ Sch Management Xian 710072 Peoples R China Ecole Cent Paris Lab Genie Ind F-92295 Chatenay Malabry France Univ Technol Troyes Lab LOSI F-10010 Troyes France 

出 版 物：《INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH》 (国际生产研究杂志)

年 卷 期：2011年第49卷第19期

页      面：5679-5693页

核心收录：

学科分类：12[管理学] 120202[管理学-企业管理（含：财务管理、市场营销、人力资源管理）] 0202[经济学-应用经济学] 02[经济学] 1202[管理学-工商管理] 1201[管理学-管理科学与工程(可授管理学、工学学位)] 0802[工学-机械工程] 

基　　金：National Natural Science Foundation of China [50605052, 71071129] Humanities, Social Sciences and Management Innovation Foundation of Northwestern Polytechnical University [RW200902] 

主　　题：cyclic hoist scheduling multi-degree time window constraints branch-and-bound 

摘      要：This paper deals with the multi-degree cyclic single-hoist scheduling problem with time window constraints, in which multiple identical parts enter and leave the system during each cycle. We propose an analytical mathematical model and a branch-and-bound algorithm so as to find a cyclic sequence of hoist moves that maximises the throughput. The branch-and-bound algorithm implicitly enumerates the sequence of hoist moves and requires the solution of a specific set of linear programming problems (LPPs). Computational results on benchmark instances and randomly generated test instances are presented.