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

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1002/nav.20471 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2099189023 / rank
 
Normal rank
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 08:17, 5 July 2024

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

    Statements

    Identifiers