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

Full description

Saved in:
Bibliographic Details
Main Authors: LIM, Andrew, RODRIGUES, Brian, XU, Zhou
Format: text
Language:English
Published: Institutional Knowledge at Singapore Management University 2007
Subjects:
Online Access:https://ink.library.smu.edu.sg/lkcsb_research/606
https://doi.org/10.1002/nav.20189
Tags: Add Tag
No Tags, Be the first to tag this record!
Institution: Singapore Management University
Language: English
Be the first to leave a comment!
You must be logged in first