Crane scheduling in railway yards: an analysis of computational complexity (Q1707828): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Modeling and optimization of the intermodal terminal mega hub / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Solutions to Some Transportation Problems with Applications to Minimizing Robot Arm Travel / rank
 
Normal rank
Property / cites work
 
Property / cites work: A review of TSP based approaches for flowshop scheduling / 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: When road trains supply freight trains: scheduling the container loading process by gantry crane between multi-trailer trucks and freight trains / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey on single crane scheduling in automated storage/retrieval systems / 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: The dial-a-ride problem: Models and algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solution of a Large-Scale Traveling-Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computer-Aided Complexity Classification of Dial-a-Ride Problems / 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: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sequencing a One State-Variable Machine: A Solvable Case of the Traveling Salesman Problem / 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: Clustering-based order-picking sequence algorithm for an automated warehouse / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integer Programming Formulation of Traveling Salesman Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic Aspects of Pyramidal Tours with Restricted Jump-Backs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Order-Picking in a Rectangular Warehouse: A Solvable Case of the Traveling Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Routing order pickers in a warehouse with a middle aisle / rank
 
Normal rank
Property / cites work
 
Property / cites work: The n-line traveling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of satisfiability problems / rank
 
Normal rank

Revision as of 09:24, 15 July 2024

scientific article
Language Label Description Also known as
English
Crane scheduling in railway yards: an analysis of computational complexity
scientific article

    Statements

    Crane scheduling in railway yards: an analysis of computational complexity (English)
    0 references
    0 references
    0 references
    4 April 2018
    0 references
    intermodal transportation
    0 references
    railway yards
    0 references
    crane scheduling
    0 references
    computational complexity
    0 references
    0 references

    Identifiers