The quay crane scheduling problem with time windows (Q2892125): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: A fast heuristic for quay crane scheduling with interference constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey of berth allocation and quay crane scheduling problems in container terminals / rank
 
Normal rank
Property / cites work
 
Property / cites work: A crane scheduling method for port container terminals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithm Theory - SWAT 2004 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A <i>m</i>‐parallel crane scheduling problem with a non‐crossing constraint / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quay crane scheduling at container terminals to minimize the maximum relative tardiness of vessel departures / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch-and-cut algorithm for the quay crane scheduling problem in a container terminal / rank
 
Normal rank
Property / cites work
 
Property / cites work: A tabu search heuristic for the quay crane scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Crane scheduling with non-crossing constraint / rank
 
Normal rank

Latest revision as of 09:17, 5 July 2024

scientific article
Language Label Description Also known as
English
The quay crane scheduling problem with time windows
scientific article

    Statements

    The quay crane scheduling problem with time windows (English)
    0 references
    0 references
    0 references
    18 June 2012
    0 references
    0 references
    container terminal
    0 references
    quay crane scheduling
    0 references
    crane time windows
    0 references
    \texttt{CPLEX}
    0 references
    0 references