Journal
NAVAL RESEARCH LOGISTICS
Volume 54, Issue 2, Pages 115-127Publisher
JOHN WILEY & SONS INC
DOI: 10.1002/nav.20189
Keywords
modeling; machine scheduling; crane; approximation; heuristics; search
Categories
Ask authors/readers for more resources
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.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available