首页 | 本学科首页   官方微博 | 高级检索  
     


A reclaimer scheduling problem arising in coal stockyard management
Authors:Enrico Angelelli  Thomas Kalinowski  Reena Kapoor  Martin W. P. Savelsbergh
Affiliation:1.University of Brescia,Brescia,Italy;2.University of Newcastle,Newcastle,Australia;3.Georgia Institute of Technology,Atlanta,USA
Abstract:We study a number of variants of an abstract scheduling problem inspired by the scheduling of reclaimers in the stockyard of a coal export terminal. We analyze the complexity of each of the variants, providing complexity proofs for some and polynomial algorithms for others. For one, especially interesting variant, we also develop a constant factor approximation algorithm.
Keywords:
本文献已被 SpringerLink 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号