期刊
NAVAL RESEARCH LOGISTICS
卷 54, 期 2, 页码 115-127出版社
JOHN WILEY & SONS INC
DOI: 10.1002/nav.20189
关键词
modeling; machine scheduling; crane; approximation; heuristics; search
In this paper, we study a m-parallel machine scheduling problem with a non-crossing constraint motivated by crane scheduling in ports. We decompose the problem to allow time allocations to be determined once crane assignments are known and construct a backtracking search scheme that manipulates domain reduction and pruning strategies. Simple approximation heuristics are developed, one of which guarantees solutions to be at most two times the optimum. For large-scale problems, a simulated annealing heuristic that uses random neighborhood generation is provided. Computational experiments are conducted to test the algorithms. (c) 2006 Wiley Periodicals, Inc.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据