A m-Parallel Crane Scheduling Problem with a Non-Crossing Constraint

• المؤلفون الرئيسيون: LIM, Andrew, RODRIGUES, Brian, XU, Zhou
• التنسيق: text
• اللغة: English
• منشور في: Institutional Knowledge at Singapore Management University 2007
• الموضوعات: modeling; machine scheduling; crane; approximation; heuristics; search; Operations and Supply Chain Management
• الوصول للمادة أونلاين: https://ink.library.smu.edu.sg/lkcsb_research/606; https://doi.org/10.1002/nav.20189
• المؤسسة: Singapore Management University

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...