A m-Parallel Crane Scheduling Problem with a Non-Crossing Constraint
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 doma...
Saved in:
Main Authors: | , , |
---|---|
格式: | text |
語言: | English |
出版: |
Institutional Knowledge at Singapore Management University
2007
|
主題: | |
在線閱讀: | https://ink.library.smu.edu.sg/lkcsb_research/606 https://doi.org/10.1002/nav.20189 |
標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|
成為第一個發表評論!