文献类型：期刊文献

英文题名：Scheduling Reclaimer Operations in the Stockyard to Minimize Makespan

作者：Wang, Chao[1];Lu, Xi-wen[1];Sitters, Ren[2]

机构：[1]East China Univ Sci & Technol, Shanghai 200237, Peoples R China;[2]Vrije Univ Amsterdam, De Boelelaan 1105, NL-1081 HV Amsterdam, Netherlands

年份：2018

卷号：34

期号：3

起止页码：597

外文期刊名：ACTA MATHEMATICAE APPLICATAE SINICA-ENGLISH SERIES

收录：;WOS:【SCI-EXPANDED(收录号:WOS:000441231700011)】；

基金：Supported by the National Natural Science Foundation of China (No. 11371137 and No. 71431004)

语种：英文

外文关键词：scheduling; approximation algorithm; performance ratio; numerical simulation

摘要：This paper considers a reclaimer scheduling problem in which one has to collect bulk material from stockpiles in the quay in such a way that the time used is minimized. When reclaimers are allowed to work on the same stockpile simultaneously, a fully polynomial time approximation scheme (FPTAS) is designed. Further, we present a 2-approximation algorithm in the case that any stockpile can be handled by only one reclaimer at a time. When the number of reclaimers is two, we give a 3/2-approximation algorithm. Numerical experiments show that the algorithms perform much better than our worst case analysis guarantees.