New bounds and algorithms for the transshipment yard scheduling problem (Q2434300): 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.1007/s10951-010-0200-2 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2150752107 / 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: Scheduling trams in the morning / 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: A Survey of Optimization Models for Train Routing and Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimised loading patterns for intermodal trains / rank
 
Normal rank
Property / cites work
 
Property / cites work: The train marshalling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: One-Half Approximation Algorithms for the k-Partition Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fuzzy dispatching model and genetic algorithms for railyards operations / 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: A <i>m</i>‐parallel crane scheduling problem with a non‐crossing constraint / rank
 
Normal rank
Property / cites work
 
Property / cites work: Opportunities for OR in intermodal freight transport research: A review. / 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: Q4739657 / rank
 
Normal rank
Property / cites work
 
Property / cites work: TSP ejection chains / 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: Q4323632 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Real-time dispatch of trams in storage yards / rank
 
Normal rank
Property / cites work
 
Property / cites work: Crane scheduling with non-crossing constraint / rank
 
Normal rank

Latest revision as of 08:32, 7 July 2024

scientific article
Language Label Description Also known as
English
New bounds and algorithms for the transshipment yard scheduling problem
scientific article

    Statements

    New bounds and algorithms for the transshipment yard scheduling problem (English)
    0 references
    0 references
    0 references
    0 references
    5 February 2014
    0 references
    railway systems
    0 references
    transshipment yard
    0 references
    train scheduling
    0 references
    branch-and-bound
    0 references
    ejection chain
    0 references

    Identifiers

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