Gantry crane and shuttle car scheduling in modern rail-rail transshipment yards (Q2362173): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: VRP / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s00291-016-0461-z / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2514513697 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modeling and optimization of the intermodal terminal mega hub / rank
 
Normal rank
Property / cites work
 
Property / cites work: On some matching problems arising in vehicle scheduling models / 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 follow-up survey of berth allocation and quay crane scheduling problems in container terminals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Models and Algorithms for Container Allocation Problems on Trains in a Rapid Transshipment Shunting Yard / rank
 
Normal rank
Property / cites work
 
Property / cites work: Determining crane areas in intermodal transshipment yards: the yard partition problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: New bounds and algorithms for the transshipment yard scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A generalized classification scheme for crane scheduling with interference / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combined vehicle routing and scheduling with temporal precedence and synchronization constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimized load planning of trains in intermodal transportation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust load planning of trains in intermodal transportation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Well-Solvable Special Cases of the Traveling Salesman Problem: A Survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Workforce scheduling and routing problems: literature survey and computational study / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimizing the landside operation of a container terminal / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Ant Colony System Hybridized with a New Local Search for the Sequential Ordering Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Dynamic Programming Approach to Sequencing Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: How to park freight trains on rail-rail transshipment yards: the train location problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity results for scheduling tasks with discrete starting times / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Vehicle Routing Problem / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 01:56, 14 July 2024

scientific article
Language Label Description Also known as
English
Gantry crane and shuttle car scheduling in modern rail-rail transshipment yards
scientific article

    Statements

    Gantry crane and shuttle car scheduling in modern rail-rail transshipment yards (English)
    0 references
    0 references
    0 references
    0 references
    6 July 2017
    0 references
    container logistics
    0 references
    railway terminals
    0 references
    crane scheduling
    0 references
    multiple traveling salesman problem
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references